Light OJ – 1311 – Unlucky Bird


/*
Link : http://www.lightoj.com/volume_showproblem.php?problem=1311
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define CIN ios_base::sync_with_stdio(0)
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,n) for(int i=0;i<n;i++)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d: ",z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);

    int t;
    double v1,v2,v3,a1,a2,t1,t2;
    cin>>t;
    TEST_CASE(t)
    {
        cin>>v1>>v2>>v3>>a1>>a2;
        PRINT_CASE;
        t1=v1/a1;
        t2=v2/a2;
        double ans1=((v1*t1)-.5*a1*t1*t1)+((v2*t2)-.5*a2*t2*t2);
        double ans2=max(t1,t2)*v3;
        pf("%lf %lf\n",ans1,ans2);
    }
    return 0;
}


Advertisements