HDU 5761 Rower Bo

公式：a*v1/(v1*v1-v2*v2)，注意a==0的时候，直接输出0.

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi = acos(-1.0), eps = 1e-8;
void File()
{
    freopen("D:\\in.txt", "r", stdin);
    freopen("D:\\out.txt", "w", stdout);
}
inline int read()
{
    char c = getchar();  while (!isdigit(c)) c = getchar();
    int x = 0;
    while (isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); }
    return x;
}

int a,v1,v2;

int main()
{
    while(~scanf("%d%d%d",&a,&v1,&v2))
    {
        if(a==0) printf("0\n");
        else {
            if(v1<=v2) printf("Infinity\n");
            else printf("%lf\n",1.0*a*v1/(v1*v1-v2*v2));
        }
    }
    return 0;
}