Unusual Team（水题）

最新推荐文章于 2022-03-20 15:00:01 发布

Baiyi_destroyer

最新推荐文章于 2022-03-20 15:00:01 发布

阅读量217

点赞数

CC 4.0 BY-SA版权

分类专栏：水题集

本文链接：https://blog.youkuaiyun.com/Baiyi_destroyer/article/details/80053549

水题集专栏收录该内容

98 篇文章

订阅专栏

一只狮子、老鼠和海狸组成的队伍需要从两个名字中选择一个作为参赛名称。他们进行了Facebook投票来帮助做决定。本篇将展示如何通过输入的投票数确定最终采用哪个团队名称。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

A lion, a mouse, and a beaver are one of the best teams at Animal University, and they have qualified to the ACM Arabella 2017 contest!

They want to choose their team name, and after many suggestions, they have reduced their options to two names: "FunkyMonkeys" and "WeWillEatYou".

They then created a poll on Facebook to help them with their final decision.

The results of the poll are now with Dr. Samer, and he will use the name with the highest votes to register the team. Can you help Dr. Samer to know which team name they will register with?

Input

The first line of input is T – the number of test cases.

The first line of each test case contains two integers a, b (1 ≤ a, b ≤ 100) - the number of votes for "FunkyMonkeys" and "WeWillEatYou" respectively.

Output

For each test case, output a single line containing "FunkyMonkeys" (without quotes), if that name received more points or tied with “WeWillEatYou”, otherwise output “WeWillEatYou”.

Sample Input

2
15 20
70 70

Sample Output

WeWillEatYou
FunkyMonkeys

代码如下：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <vector>
#include <string>
#define For(i,n) for(int i=0;i<n;i++)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
const int maxn = 1e4+5;
const int INF = 0x3f3f3f3f;
const double Pi = acos(-1);
int main() {
    int t;
    int a,b;
    cin >>  t;
    while(t--){
        cin >>a >> b;
        if(b > a)
            cout << "WeWillEatYou" << endl;
        else
            cout <<"FunkyMonkeys" << endl;

    }
    return 0;
}