Anti-Adjacency

AtCoder

IDyahoo_procon2019_qual_a

Time2000ms

Memory256MB

Difficulty—

Determine if we can choose $K$ different integers between $1$ and $N$ (inclusive) so that no two of them differ by $1$. ## Constraints * $1\leq N,K\leq 100$ * $N$ and $K$ are integers. ## Input Input is given from Standard Input in the following format: $N$ $K$ [samples]

Samples

Input #1

3 2

Output #1

YES

We can choose $1$ and $3$.

Input #2

5 5

Output #2

NO

Input #3

31 10

Output #3

YES

Input #4

10 90

Output #4

NO

API Response (JSON)

{
  "problem": {
    "name": "Anti-Adjacency",
    "description": {
      "content": "Determine if we can choose $K$ different integers between $1$ and $N$ (inclusive) so that no two of them differ by $1$.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "yahoo_procon2019_qual_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Determine if we can choose $K$ different integers between $1$ and $N$ (inclusive) so that no two of them differ by $1$.\n\n## Constraints\n\n*   $1\\leq N,K\\leq 100$\n*   $N$ and $K$ are integers.\n\n## Input...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments