Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Need help with this lab for my c++ class. CSC326 Program I Review of C++Programming Constructs Structs and Arrays (This lab assignment is from Prof.

Need help with this lab for my c++ class. image text in transcribed
image text in transcribed
CSC326 Program I Review of C++Programming Constructs Structs and Arrays (This lab assignment is from Prof. Sarah Zelikovitz.) 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 monifor their work. As each does his or her part of your project, you eep 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.neach 1000 lines ebuggodo de LYou hope this is programmer #9 or #10 ) As further proof of the value of these ew techniques, you want to determine how many poor prosrammers it takes to surpass the winner's figure; that k) is, find the smallest k such that have tumed in more lines than hewinner.- 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 I to l0), and the second is the number of executable lines of code turned in, and the third has the numher of lincs af comments furmed in. These numbers occur in the same order as that in whtcth the modules were turned in. Data is in http://www.cs.csi.cuny.edul-yumei/cse326/datalprogram lL.txt and Processing Read in integers until someone's total executable code goes over 1000. 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 I-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 200 400 100 PINAL TOTALS Programmer Lines of Code 51 105 309 101 215 Lines of Comment It took programmers 1 through 7 to produce more than the Winne r

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

SQL Server Query Performance Tuning

Authors: Sajal Dam, Grant Fritchey

4th Edition

1430267429, 9781430267423

More Books

Students also viewed these Databases questions