--Deadline:2016-12-8 20:00pm
--Job Description: https://edu.cnblogs.com/campus/bjgygd/Sixteen-One/homework/213
--Summary of the 11th time assignment:
1. This time there are 12 students did not submit homework, some because the previous submissions are identical, this time simply do not submit ... (; ′⌒ ')
2. Some students have already indicated that some of their code is reference, good, please make sure you can switch to your own knowledge reserve.
3. Pointers This chapter is difficult, especially the second question, many students have not mastered, the correct solution is:
1#include <stdio.h>2 3 voidFindmax (int* px,int* PY,int*Pmax);4 5 intMainvoid)6 {7 intx, y, Max;8printf"Enter x, y:");9scanf"%d%d", &x, &y);TenFindmax (&x, &y, &max); Oneprintf"The biggest:%d\n", Max);
A return 0; - } - the voidFindmax (int* px,int* PY,int*Pmax) - { -*pmax = *px > *py? *PX: *py; -}
4. If you encounter a problem that you do not have, refer to someone else's code, please specify below! And please carefully verify, think about the correctness of the procedure! Be sure to compile and run the validation, give the test cases, to ensure that through, if there is a problem, can be summarized in the essay when the stickers, I will give feedback in time! Thank you!
--tenth assignment scoring rules:
Total 100 points: Among them, the coding program submits 70 points (according to the code steps, format, comments, structure correctness to allocate), blog writing 30 points, delay a day deduction 10 points, until the end of 100 points.
Ranking Pending |
School Number |
Coding.net (3*4+ 2*4 +7*4 + 3*4) 4 Questions Submitted: 3 * 4 Style: 2 * 4 4 questions Correct: 7 * 4 Independent thinking: 3 * 4 |
Bloggers (30) |
Register Coding.net |
Late Delivery (0) |
Not delivered ( -10/D) |
Bonus points (--) Submit Job Order |
Note |
Total Scores (100) |
1 |
**101 |
3*2+2+8+2=18 |
36 |
Gdxx_160809101 |
|
9 |
12-08 20:00 |
1. Question second to third not submitted 2. The first question compilation failed. The use of commas and semicolons is not distinguished, please be careful! 3. Select sort is not completed. |
54 |
2 |
**102 |
3*4+1*4+20+4=40 |
40 |
gdxx_102 |
|
8 |
12-08 20:00 |
1. There is an understanding problem with the type definition of a custom function. |
80 |
3 |
**103 |
3*4+6+20+10=48 |
36 |
Gdxx_160809103sundeyi |
-5 |
11 |
12-08 21:02 |
1. The first is titled Complete selection sorting. 2. Try to keep a line of statements in the habit. 3. Question second to third was not completed. (Complete two additional questions can be replaced) 4. Refer to the online answer, you need to combine the topic requirements, understand the application to their own programs, such as palindrome requirements to define a palindrome function. |
84-5 |
4 |
**104 |
0 |
0 |
gdxx-104 |
|
Code not submitted |
|
Not delivered |
0 |
5 |
**105 |
0 |
0 |
gdxx_105 |
|
Code not submitted |
|
Not delivered |
0 |
6 |
**106 |
0 |
0 |
gdxx-106 |
|
Code not submitted |
|
Not delivered |
0 |
7 |
**107 |
3*4+1*4+18+10=44 |
38 |
gdxx_107 |
|
6 |
12-08 19:45 |
1. First question not implemented select sort 2. The second question is understood incorrectly. 3. Come on! The binary lookup algorithm can be contacted privately. |
82 |
8 |
**108 |
0 |
0 |
gdxx_108-160809108 |
|
Code not submitted |
|
Not delivered |
0 |
9 |
**109 |
*4+2*4+ (8+7+7+3) +15=60 |
30 |
gdxx_109 |
|
9 |
12-08 21:51 |
1. Be aware of array cross-border issues. 2. Question fourth, the title requires support for 80 characters, not 5, and requires the output of the maximum number of subscripts, need to take into account the case of duplicate elements. |
90 |
10 |
**110 |
10 |
0 |
gdxi_110 |
-5 |
12 |
12-08 21:10 |
1. Encourage and finally submit the code. 2. But the same as the 1031 mode ... |
10-5 |
11 |
**111 |
3*3+0+16+0=25 |
25 |
gdxx_111 |
|
5 |
12-08 19:13 |
1. Please submit a. cpp file to coding.net. 2. The first question is not completed select sort. 3. The second question was not submitted. 4. Please note the code style, ensure legibility! 5. function declaration position is incorrect |
50 |
12 |
**112 |
0 |
20 |
gdxx_112 |
|
Code not submitted |
|
1. The code is not submitted. 2. The contents of the essay are not complete. |
20 |
13 |
**113 |
3+2+7+3=15 |
40 |
gdxx_113 |
-10 |
16 |
12-11 18:37 |
1. Only one question was submitted 2. Additional incentives Independent Thinking +10 |
55+10-10 |
14 |
**114 |
0 |
0 |
gdxx_114 |
|
Code not submitted |
|
Not delivered |
0 |
15 |
**115 |
3*4+2*4+16+8=44 |
35 |
gdxx_115 |
|
7 |
12-08 19:46 |
1. The first question does not realize the selection sort; 2. The second question does not understand the topic requirements; 3. The third question made a low-level mistake, please be careful. |
79 |
16 |
**116 |
0 |
0 |
gdxx_160809116 |
|
Code not submitted |
|
Not delivered |
0 |
17 |
**117 |
3*4+2*4+7*3+3*4=53 |
40 |
gdxx_117 |
|
1 |
12-04 02:29 |
1. Take it very seriously and hope to keep it going. 2. There is still a problem with the call to the custom function, you can take the time to ask the teacher, for example, the second question, you define the Findmax, but there is no place to use this function in the whole program. 3. The additional question is done very well! + 10 |
93 + 10 |
18 |
**118 |
3*4+2*4+20+3=43 |
38 |
gdxx_118 |
-5 |
15 |
12-09 15:30 |
1. Choose the sorting implementation incorrectly. 2. The second question is wrong. The Findmax function that you defined is not called. 3. Additional title +10 |
81+10-5 |
19 |
**119 |
0 |
0 |
gdxx_119 |
|
Code not submitted |
|
Not delivered |
0 |
20 |
**120 |
0 |
0 |
gdxx120 |
|
Code not submitted |
|
Not delivered |
0 |
21st |
**122 |
0 |
0 |
gdxx-122 |
|
Code not submitted |
|
Not delivered |
0 |
22 |
**124 |
0 |
0 |
gdxx124 |
|
Code not submitted |
|
Not delivered |
0 |
23 |
**125 |
0 |
0 |
gdxx_125 |
|
Code not submitted |
|
Not delivered |
0 |
24 |
**126 |
3*3+5+16+3=33 |
37 |
gdxx_126 |
-5 |
10 |
12-08 20:13 |
1. First question select Sort not completed. 2. The usage of + = is not mastered. 3. The second question was not completed. |
70-5 |
25 |
**127 |
3*4+2*4+21+10=51 |
40 |
gdxx_127-160809127 |
-5 |
13 |
12-08 23:51 |
1. Please refer to the comments on the second question. 2. Additional title +10 |
91+10-5 |
26 |
**128 |
0 |
0 |
gdxx_128-160809128 |
|
Code not submitted |
|
Not delivered |
0 |
27 |
**129 |
3*3+2*3+21+10=46 |
40 |
gdxx_129 |
-5 |
14 |
12-09 14:25 |
1. The second question was not submitted 2. Additional title +5 |
86+5-5 |
28 |
**130 |
3*4+2*4+7*3+0=41 |
35 |
Huang Jing Antelope |
|
4 |
12-08 19:12 |
1. Beginner hands must be mastered in time. |
76 |
29 |
**131 |
3*4+2*4+7*3+5=46 |
39 |
gdxx_131 |
|
2 |
12-08 10:08 |
1. There are some problems with the completion of the second question, and there are some problems with understanding the type definition of the custom function. 2. Additional title +10 |
85+10 |
30 |
**132 |
3*4+2*4+7*3+0=41 |
39 |
gdxx_160809132 |
|
3 |
12-08 17:45 |
1. Yes, it's better than last time. 2. You can have your own knowledge of the reference. |
80 |
Gengdan 16-1 11th time operation