题目描述了在两个城市A和B之间的公交车运行情况。Simion从城市A出发前往城市B，想知道在途中会遇到多少辆从城市B出发的公交车。输入包含公交车的发车频率和行驶时间，以及Simion的出发时间。输出Simion在途中遇到的公交车数量。第一例中，Simion在05:20出发，05:50到达，将遇到5辆从B站出发的公交车。
Buses run between the cities A and B, the first one is at 05:00 AM and the last one departs not later than at 11:59 PM. A bus from the city A departs every a minutes and arrives to the city B in a ta minutes, and a bus from the city B departs every bminutes and arrives to the city A in a tb minutes.
The driver Simion wants to make his job diverse, so he counts the buses going towards him. Simion doesn't count the buses he meet at the start and finish.
You know the time when Simion departed from the city A to the city B. Calculate the number of buses Simion will meet to be sure in his counting.
Input
The first line contains two integers a, ta (1 ≤ a, ta ≤ 120) — the frequency of the buses from the city A to the city B and the travel time. Both values are
最低0.47元/天 解锁文章
1065
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
