1019 : New Tortoise and the Hare
- 时间限制Time Limit
- 1 秒Sec
- 内存限制Memory Limit
- 128 兆MB
- 提交次数Submitted
- 6 次Times
- 通过次数Solved
- 4 次Times
| 比对Compare | token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored. |
|---|---|
| 不同则错Differs | token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ. |
| 输入Input | 标准输入,格式见题面。Standard input; format as in the statement. |
| 输出Output | 标准输出。Standard output. |
| 时间与内存Time and memory | 记这一份程序的 CPU 时间和内存峰值。题目上的时间限制、内存限制就是这一份的上限。The record is this program’s CPU time and peak memory. The limits on the problem apply to this one run. |
题目描述Description
The tortoise and the hare agreed to race again. The hare intends to let the tortoise run for a while, and then catch up with it before the finish line.
L,vt,vh,p
respectively represent the length of the track, the speed of the
tortoise (per second), the speed of the hare (per second), and the
distance the tortoise has traveled when the hare starts.
Can the hare catch up with the tortoise?
输入格式Input
There are multiple test cases. Each line contains four integers
L,vt,vh,p
correspondingly.
10 <= L <= 1000,
1 <= vt < vh <= 1000,
1 <= p <= L.
The cases ends with EOF.
输出格式Output
Output a number a line corresponding to each case.
If the hare can catch up with the tortoise before (include) the finish line, the output is the time the hare need to catch up with the tortoise. The result should be accurated to two decimal places.
Otherwise, output -1.
样例Sample
提示Hint
EOF means the end of the file. In C
language, we could use:
while(scanf("%d%d%d%d", &L, &vt, &vh, &p) != EOF)
{
// Do what you need.
}to recognise it.
出题Author
CSGrandeur