【2012天津区域赛】部分题解 hdu4431—4441

#include <set>
#include <map>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
double x, y;
double p, q;
double fun1()
{
double a1 = q*p*p*(x+y);
double a2 = q*p*(1-p)*x;
double a3 = q*p*(1-p)*y;
double a4 = (1-q)*x;
return a1+a2+a3+a4;
}
double fun2()
{
double a1 = (1-q) * p*p*(x+y);
double a2 = (1-q)*p*(1-p)*x;
double a3 = (1-q)*p*(1-p)*y;
double a4 = (q)*y;
return a1+a2+a3+a4;;
}
int main()
{

int t;
cin>>t;
while (t--)
{
scanf ("%lf%lf%lf%lf",&x, &y, &p, &q);
if (fun1() > fun2())
{
printf("tiger %.4f\n", fun1());
}
else
printf("wolf %.4f\n", fun2());
}
return 0;
}