UVA 10868 - Bungee Jumping

来源：互联网发布：centos7打开8080端口编辑：程序博客网时间：2024/05/01 11:35

这道题很简单，直接AC就可以了。

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#define M 1
using namespace std;
int main()
{
    double k,l,s,m,g,v,ll,lll;
    g=9.81;
    while(cin>>k>>l>>s>>m &&(k||l||s||m))
    {
        if(s<=l+1e-6)
        {
            v=sqrt(2*g*s);
            if((v-10.0)>1e-6)
            cout<<"Killed by the impact."<<endl;
            else
            cout<<"James Bond survives."<<endl;
            continue;
        }
        ll=m*g/k;
        if(s<=(l+ll+1e-6))
        {
            s-=l;
            double a=(m*g+m*g-k*s)/2/m;
            v=sqrt(2*g*l+2*a*s);
            if((v-10.0)>1e-6)
            cout<<"Killed by the impact."<<endl;
            else
            cout<<"James Bond survives."<<endl;
            continue;
        }
        lll=sqrt(m*(2*g*l+m*g*g/k)/k);
        if(s<=(l+ll+lll+1e-6))
        {
            s=s-l-ll;
            v=sqrt(k*(lll+s)/m*(lll-s));
            if((v-10.0)>1e-6)
            cout<<"Killed by the impact."<<endl;
            else
            cout<<"James Bond survives."<<endl;
            continue;
        }
        cout<<"Stuck in the air."<<endl;
    }
    return 0;
}

0 0