题目链接
https://www.patest.cn/contests/gplt/L1-031
AC代码
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>
using namespace std;
typedef long long LL;
const double PI = 3.14159265358979323846264338327;
const double E = 2.718281828459;
const double eps = 1e-6;
const int MAXN = 0x3f3f3f3f;
const int MINN = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
int main()
{
int n;
cin >> n;
while (n--)
{
double a, b;
cin >> a >> b;
double temp;
temp = (a - 100) * 0.9 * 2;
if (fabs(b - temp) < temp * 0.1)
printf("You are wan mei!\n");
else if (b < temp)
printf("You are tai shou le!\n");
else
printf("You are tai pang le!\n");
}
}