Your program should output the number of times Martha plays until she goes broke. Your program should take as input the number of quarters in Martha's jar (there will be at least one and fewer than 1000), and the number of times each machine has been played since it last paid. The first machine pays 30 quarters every 35th time it is played the second machine pays 60 quarters every 100th time it is played the third pays 9 quarters every 10th time it is played. Unknown to her, the machines are entirely predictable. Martha takes a jar of quarters to the casino with the intention of becoming rich. Solution to 1st Senior program (3rd on Junior level) writen in C++. Posted: Sat 2:29 pm Post subject: CCC 2000 Stage1: S1J3: Slot Machines ![]() Wiki Blog Search Turing Chat Room Members
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |