CCC '00 S1 - Slot Machines - Olympiads Online Judge

CCC '00 S1 - Slot Machines

View as PDF

Submit solution

All submissions

Best submissions

Points: 5 (partial)

Time limit: 1.0s

Memory limit: 256M

Problem type

Canadian Computing Competition: 2000 Stage 1, Junior #3, Senior #1

Martha takes a jar of quarters to the casino with the intention of becoming rich. She plays three machines in turn. Unknown to her, the machines are entirely predictable. Each play costs one quarter. The first machine pays $30$ $30$ quarters every $35^{th}$ $35^{t h}$ time it is played; the second machine pays $60$ $60$ quarters every $100^{th}$ $100^{t h}$ time it is played; the third pays $9$ $9$ quarters every $10^{th}$ $10^{t h}$ time it is played.

Input Specification

Your program should take as input the number of quarters in Martha's jar (there will be at least one and fewer than $1000$ $1000$ ), and the number of times each machine has been played since it last paid.

Output Specification

Your program should output the number of times Martha plays until she goes broke.

Sample Input

Copy

Sample Output

Copy

Martha plays 66 times before going broke.

Comments

0

noob0king123 commented 18 days ago

why does it say i have the wrong answer and someone please tell me what Clipped means

0

nevergothere commented 61 days ago

For this question, don't forget to print "Martha plays (numbers) times before going broke.""

3

Jules830 commented on Dec. 19, 2024, 3:43 p.m.

I think that we should change our currency to corn, it would be much more sustainable, and imagine winning at a slot machine and all the corn just comes out in a pool of golden glory.