119. Division One

Codeforces

IDCF10269119

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

You recently performed well in an online Codeforces contest, and you became part of "Division 1" on Codeforces. However, you're not sure that it will last. If you have a rating of 1900 or higher you're considered Division 1, otherwise, you're considered Division 2. In each contest after you became Division 1, you didn't perform very well. Thus, your rating will decrease by 50 in each contest. Given your start rating, figure out how many contests it will take for you to become Division 2. For example, if your start rating was $1970$, your rating would be $1920$ after the first contest, and after the second contest your rating would be $1870$, and you would become Division 2. The only line of input contains a single positive integer $n$: your rating after the recent good contest. Output a single positive integer $c$: the number of contests that you can still do before you become Division 2. ## Input The only line of input contains a single positive integer $n$: your rating after the recent good contest. ## Output Output a single positive integer $c$: the number of contests that you can still do before you become Division 2. [samples]

**Definitions** Let $ n \in \mathbb{Z} $ be the initial rating, with $ n \geq 1900 $. **Constraints** $ n \geq 1900 $ **Objective** Find the smallest positive integer $ c $ such that: $$ n - 50c < 1900 $$

API Response (JSON)

{
  "problem": {
    "name": "119. Division One",
    "description": {
      "content": "You recently performed well in an online Codeforces contest, and you became part of \"Division 1\" on Codeforces. However, you're not sure that it will last. If you have a rating of 1900 or higher you'r",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10269119"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You recently performed well in an online Codeforces contest, and you became part of \"Division 1\" on Codeforces. However, you're not sure that it will last. If you have a rating of 1900 or higher you'r...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the initial rating, with $ n \\geq 1900 $.  \n\n**Constraints**  \n$ n \\geq 1900 $  \n\n**Objective**  \nFind the smallest positive integer $ c $ such that:  \n$$...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments