#g. 1IXMMMl31IpEFF#":>$
1IXMMMl31IpEFF#":>$
该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。
Statement
One of the days of the hike coincided with a holiday, so in the evening at the camp, it was decided to arrange a festive fireworks display. For this purpose, the organizers of the hike bought two installations for launching fireworks and a huge number of shells for launching.
Both installations are turned on simultaneously. The first installation launches fireworks every minutes (i.e., after minutes after launch). The second installation launches fireworks every minutes (i.e., after minutes after launch).
Each firework is visible in the sky for minutes after launch, i.e., if a firework was launched after minutes after the installations were turned on, it will be visible every minute from to , inclusive. If one firework was launched minutes after another, both fireworks will be visible for one minute.
What is the maximum number of fireworks that could be seen in the sky at the same time?
Format
Input
Each test consists of several test cases. The first line contains a single integer ( ) — the number of test cases. Then follow the descriptions of the test cases.
The first and only line of each test case contains integers , , ( ) — the frequency of launching for the first installation, the second installation, and the time the firework is visible in the sky.
Output
For each set of input data, output a single number — the maximum number of fireworks that can be seen simultaneously.
Sample
6
6 7 4
3 4 10
7 8 56
5 6 78123459896
1 1 1
1 1 1000000000000000000
2
7
17
28645268630
4
2000000000000000002
ShanghaiTech ACM 炸鱼杯
- 状态
- 已结束
- 规则
- OI
- 题目
- 46
- 开始于
- 2024-12-10 23:00
- 结束于
- 2024-12-15 13:00
- 持续时间
- 110 小时
- 主持人
-
_Arahc_
- 参赛人数
- 112