Homer Simpson#875
Homer Simpson, a very smart guy, likes eating Krusty-burgers. It takes Homer minutes to eat a Krusty-burger. However, there's a new type of burger in Apu's Kwik-e-Mart. Homer likes those too. It takes him minutes to eat one of these burgers. Given minutes, you have to determine the maximum number of burgers Homer can eat within the time limit.
If Homer cannot exactly fill the lunch break, output the remaining time as well. The goal is to find a combination where the leftover time is as small as possible.
Each test case consists of three integers , , (1 \leq M, N, T \leq 1\,000\,000).
For each test case, print in a single line the maximum number of burgers Homer can eat. If there is any unused time left, also print this number separated by a single space. The output should correspond to the combination leaving as little unused time as possible.
Example 1