Constructs Structs and Arrays You are the manager of a team of ten programmers who have just completed a seminar in structured programming and top-down design. To prove to your boss that these techniques pay off you decide to run the following contest. You number the programmers 1 through 10, based on their performance in the seminar (l is poorest, 10 is best), and monitor their work. As each does his or her part of your project, you keep track of the number of lines of debugged code turned in by each programmer. You record this number as a programmer turns in a debugged module. The winner of the contest is the first person to reach l000 lines of debugged code. (You hope this is programmer #9 or #10.) As further proof of the value of these new techniques, you want to determine how many poor programmers it takes to surpass the winner's figure; that is, find the smallest k such that programmers 1 through k (excluding the winner, if he/she is in the first k) have turned in more lines than the winner. Input The input consists of a sequence of triples of integers. The first integer in each pair is the programmer's number (an integer from l to l0), and the second is the number of executable lines of code turned in, and the third has the number of lines of comments turned in. These numbers occur in the same order as that in which the modules were turned in Processing Read in integers until someone's total executable code goes over l000. Print out (echo print) each set as you read it. Ignore any input after someone's executable total exceeds 1000. Then print out a table listing the ten programmers and their totals, with the winner flagged as shown in the example that follows. Finally, find the smallest k such that the sum of the totals for programmers l-k exceeds the winner's total. Print k in an explanatory sentence. Partial Sample Output: PROGRAMMER PROGRESS Programmer Lines of Code Lines of Comments 10 230 100 . . 9 400 100 FINAL TOTALS Programmer Lines of Code Lines of Comment 1 51 2 105 3 309 4 101 5 215 6 7 It took programmers 1 through 7 to produce more than the winner. txt file 10) 130 100 8) 106 45 7) 111 20 3) 187 100 9) 336 209 1) 51 67 10) 250 200 4) 201 190 9) 341 309 2) 105 100 8) 256 209 10) 450 197 3) 250 217 5) 215 202 7) 222 122 9) 200 123 10) 330 354 7) 100 98 2nd txt file 10) 230 100 8) 206 120 7) 111 50 3) 159 56 9) 336 200 1) 51 10 10) 250 123 4) 101 29 9) 341 190 2) 105 43 8) 256 122 10) 320 120 3) 150 19 5) 215 98 7) 222 108 9) 400 210 10) 330 125
Review of C++ ProgrammingProgram 1
Constructs
Structs and Arrays
You are the manager of a team of ten programmers who have just completed a seminar in structured programming and top-down design. To prove to your boss that these techniques pay off you decide to run the following contest. You number the programmers 1 through 10, based on their performance in the seminar (l is poorest, 10 is best), and monitor their work. As each does his or her part of your project, you keep track of the number of lines of debugged code turned in by each programmer. You record this number as a programmer turns in a debugged module. The winner of the contest is the first person to reach l000 lines of debugged code. (You hope this is programmer #9 or #10.) As further proof of the value of these new techniques, you want to determine how many poor programmers it takes to surpass the winner's figure; that is, find the smallest k such that programmers 1 through k (excluding the winner, if he/she is in the first k) have turned in more lines than the winner.
Input
The input consists of a sequence of triples of integers. The first integer in each pair is the programmer's number (an integer from l to l0), and the second is the number of executable lines of code turned in, and the third has the number of lines of comments turned in. These numbers occur in the same order as that in which the modules were turned in
Processing
Read in integers until someone's total executable code goes over l000. Print out (echo print) each set as you read it. Ignore any input after someone's executable total exceeds 1000. Then print out a table listing the ten programmers and their totals, with the winner flagged as shown in the example that follows. Finally, find the smallest k such that the sum of the totals for programmers l-k exceeds the winner's total. Print k in an explanatory sentence.
Partial Sample Output:
PROGRAMMER PROGRESS
Programmer Lines of Code Lines of Comments
10 230 100
.
.
9 400 100
FINAL TOTALS
Programmer Lines of Code Lines of Comment
1 51
2 105
3 309
4 101
5 215
6
7
It took programmers 1 through 7 to produce more than the
winner.
txt file
10) 130 100
8) 106 45
7) 111 20
3) 187 100
9) 336 209
1) 51 67
10) 250 200
4) 201 190
9) 341 309
2) 105 100
8) 256 209
10) 450 197
3) 250 217
5) 215 202
7) 222 122
9) 200 123
10) 330 354
7) 100 98
2nd txt file
10) 230 100
8) 206 120
7) 111 50
3) 159 56
9) 336 200
1) 51 10
10) 250 123
4) 101 29
9) 341 190
2) 105 43
8) 256 122
10) 320 120
3) 150 19
5) 215 98
7) 222 108
9) 400 210
10) 330 125
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
