CCC '02 S1 - The Students' Council Breakfast

View as PDF

Submit solution

Points: 5
Time limit: 2.0s
Memory limit: 64M

Problem type
Canadian Computing Competition: 2002 Stage 1, Junior #3, Senior #1

The students council in your school wants to organize a charity breakfast, and since older students are both wiser and richer, the members of the council decide that the price of each ticket will be based on how many years you have been in the school. A first year student will buy a PINK ticket, a second year student will buy a GREEN ticket, a third year student will buy a RED ticket, and a fourth year student will buy an ORANGE ticket.

Assume that all tickets are sold. Each colour of ticket is uniquely priced.

Input Specification

Input the cost of a PINK, GREEN, RED, and ORANGE ticket (in that exact order), followed by the exact amount of money to be raised by selling tickets.

Output Specification

Output all combinations of tickets that produce exactly the desired amount to be raised. The combinations may appear in any order. Output the total number of combinations found. Output the smallest number of tickets to print to raise the desired amount so that printing cost is minimized.

Sample Input


Sample Output

# of PINK is 0 # of GREEN is 0 # of RED is 1 # of ORANGE is 0
# of PINK is 1 # of GREEN is 1 # of RED is 0 # of ORANGE is 0
# of PINK is 3 # of GREEN is 0 # of RED is 0 # of ORANGE is 0
Total combinations is 3.
Minimum number of tickets to print is 1.


  • 1
    Genius3435  commented on June 7, 2021, 4:27 p.m.

    Could someone look at my solution and tell me what's wrong?

    • 1
      SuperClash  commented on June 8, 2021, 10:18 a.m. edited

      Your problem appears to occur when taking in input. Reading all the integers separately (p=int(input()),g=int(input())...) instead of using open(0) resolves the error.

  • 57
    tappbros  commented on April 24, 2020, 5:29 p.m.

    Either way, I don't think the school is going to use the money effectively.

    • 1
      doesy5  commented on Sept. 3, 2021, 8:46 p.m.