178. Multiple of Two

Codeforces

IDCF10269178

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

Welcome to the CodeRams team competition! If you're not sure on the competition format or how to submit solutions, read this first. Since your team may not have time to get through all of the problems, we recommend that you read all problems (since harder problems give more points). Good luck! Here's the first problem: Given a positive number, figure out whether or not it is a multiple of two. For example, 6 is a multiple of two, while 11 is not a multiple of two. The only line of input contains a positive integer. Print YES if the integer is a multiple of 2, and NO otherwise. ## Input The only line of input contains a positive integer. ## Output Print YES if the integer is a multiple of 2, and NO otherwise. [samples]

**Definitions** Let $ n \in \mathbb{Z}^+ $ be the input integer. **Objective** Determine whether $ n \equiv 0 \pmod{2} $. **Output** $$ \begin{cases} \text{YES} & \text{if } n \equiv 0 \pmod{2} \\ \text{NO} & \text{otherwise} \end{cases} $$

API Response (JSON)

{
  "problem": {
    "name": "178. Multiple of Two",
    "description": {
      "content": "Welcome to the CodeRams team competition! If you're not sure on the competition format or how to submit solutions, read this first. Since your team may not have time to get through all of the proble",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10269178"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Welcome to the CodeRams team competition!\n\nIf you're not sure on the competition format or how to submit solutions, read this first.\n\nSince your team may not have time to get through all of the proble...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the input integer.\n\n**Objective**  \nDetermine whether $ n \\equiv 0 \\pmod{2} $.  \n\n**Output**  \n$$\n\\begin{cases}\n\\text{YES} & \\text{if } n \\equiv 0 \\pmod...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments