117 人解决,122 人已尝试。
169 份提交通过,共有 438 份提交。
2.5 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
An army of ants walk on a horizontal pole of length
The first line of input contains one integer giving the number of cases that follow. The data for each case start with two integer numbers: the length of the pole (in cm) and
For each case of input, output two numbers separated by a single space. The first number is the earliest possible time when all ants fall off the pole (if the directions of their walks are chosen appropriately) and the second number is the latest possible such time.
2 10 3 2 6 7 214 7 11 12 7 13 176 23 191
4 8 38 207
117 人解决,122 人已尝试。
169 份提交通过,共有 438 份提交。
2.5 EMB 奖励。