Rolling Dice

AtCoder

IDabc208_a

Time2000ms

Memory256MB

Difficulty—

Is it possible to get a sum of $B$ when throwing a die with six faces $1,2,\ldots,6$ $A$ times? ## Constraints * $1 \leq A \leq 100$ * $1 \leq B \leq 1000$ * $A$ and $B$ are integers. ## Input Input is given from Standard Input in the following format: $A$ $B$ [samples]

Samples

Input #1

2 11

Output #1

Yes

There are two ways to get a sum of $11$ when throwing a $6$\-faced die twice:

*   getting $6$ in the first throw and $5$ in the second throw;
*   getting $5$ in the first throw and $6$ in the second throw.

Input #2

2 13

Output #2

No

There is no way to get a sum of $13$ when throwing a $6$\-faced die twice.

Input #3

100 600

Output #3

Yes

API Response (JSON)

{
  "problem": {
    "name": "Rolling Dice",
    "description": {
      "content": "Is it possible to get a sum of $B$ when throwing a die with six faces $1,2,\\ldots,6$ $A$ times?",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc208_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Is it possible to get a sum of $B$ when throwing a die with six faces $1,2,\\ldots,6$ $A$ times?\n\n## Constraints\n\n*   $1 \\leq A \\leq 100$\n*   $1 \\leq B \\leq 1000$\n*   $A$ and $B$ are integers.\n\n## Inpu...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments