SP21058 CTPDIRTY - Dirty Plates

Lazy Louie loves to eat but he adamantly hates cleaning. That is why he has chosen to delay

The first input line contains a positive integer, n, indicating the number of eating scenarios to analyze. The next n lines contain the description of the plates. Each line contains three integers, c, s, and d, (0 plates with both sides clean, the number of plates with one side clean and the number of completely dirty plates.

For each scenario, first output the heading “Scenario #d: ”, where d is the scenario number, starting with 1. Then, print the maximum number of times a meal can be eaten before Louie has to clean. Follow the format illustrated in Sample Output.