B. Unusual Team

Codeforces

IDCF10135B

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

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? 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. 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”. ## 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”. [samples]

**Definitions** Let $ t \in \mathbb{Z} $ be the number of test cases. For each test case $ k \in \{1, \dots, t\} $, let $ a_k, b_k \in \mathbb{Z} $ denote the number of votes for "FunkyMonkeys" and "WeWillEatYou", respectively. **Constraints** 1. $ 1 \le t \le 100 $ 2. For each $ k \in \{1, \dots, t\} $: $ 1 \le a_k, b_k \le 100 $ **Objective** For each test case $ k $, output: $$ \begin{cases} \text{"FunkyMonkeys"} & \text{if } a_k \ge b_k \\ \text{"WeWillEatYou"} & \text{if } a_k < b_k \end{cases} $$

API Response (JSON)

{
  "problem": {
    "name": "B. Unusual Team",
    "description": {
      "content": "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",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10135B"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "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!\n\nThey want to choose their team name, and after many suggestions...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ t \\in \\mathbb{Z} $ be the number of test cases.  \nFor each test case $ k \\in \\{1, \\dots, t\\} $, let $ a_k, b_k \\in \\mathbb{Z} $ denote the number of votes for \"FunkyMonkeys\" an...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments