Rower Bo
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1327 Accepted Submission(s): 506
Special Judge
Problem Description
There is a river on the Cartesian coordinate system,the river is flowing along the x-axis direction.
Rower Bo is placed at (0,a)
at first.He wants to get to origin
(0,0)
by boat.Boat speed relative to water is
v
1![]()
,and the speed of the water flow is
v
2![]()
.He will adjust the direction of
v
1![]()
to origin all the time.
Your task is to calculate how much time he will use to get to origin.Your answer should be rounded to four decimal places.
If he can't arrive origin anyway,print"Infinity"(without quotation marks).
Rower Bo is placed at (0,a)
Your task is to calculate how much time he will use to get to origin.Your answer should be rounded to four decimal places.
If he can't arrive origin anyway,print"Infinity"(without quotation marks).
Input
There are several test cases. (no more than 1000)
For each test case,there is only one line containing three integers a,v
1
,v
2![]()
.
0≤a≤100
,
0≤v
1
,v
2
,≤100
,
a,v
1
,v
2![]()
are integers
For each test case,there is only one line containing three integers a,v
0≤a≤100
Output
For each test case,print a string or a real number.
If the absolute error between your answer and the standard answer is no more than 10
−4![]()
, your solution will be accepted.
If the absolute error between your answer and the standard answer is no more than 10
Sample Input
2 3 3 2 4 3
Sample Output
Infinity 1.1428571429
思路:大物...V分1,V分2列方程: (V船cosα-V水)dt = 0,(V船-V水cosα)dt = 0;解方程..
因为要约掉cosα所以 V分2不能列垂直方向上的方程(垂直出来sinα)
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
double a,x,y;
while(cin>>a>>x>>y)
{
if(a)
{
if(x > y)
printf("%.6f\n",a/(x-(y*y/x)));
else
cout<<"Infinity"<<endl;
}
else
cout<<0.000000<<endl;
}
}