By Ricardo Oliveira, UFPR Brazil
To get fit until next summer, you and your friend decided to run on the streets in the campus every morning. Usually, you run together. However, today your friend started running early and, hence, he is a little ahead of you now.
Right now, your friend is S meters away from you. You are running at a constant speed of va meters per second, and your friend is running at a constant speed of vb meters per second. The following figure shows the situation:
Your task is to determine whether you will reach your friend, and, if so, how many seconds it will take.
The input contains several test cases. The only line in each test case contains three integers S, va and vb (1 ≤ S, va, vb ≤ 103), the current distance between you and your friend (in meters), your speed (in meters per second) and your friend’s speed (in meters per second), respectively.
The input ends with end-of-file (EOF).
For each test case, if you cannot reach your friend, print a line containing “impossivel” (without quotes). Otherwise, print a line containing the time it takes, in seconds, for you to reach your friend. Round and print the answer with exactly two decimal places.
|Input Sample||Output Sample|
1 2 1