Painting Balls with AtCoDeer

AtCoder

IDabc046_b

Time2000ms

Memory256MB

Difficulty—

There are $N$ balls placed in a row. AtCoDeer the deer is painting each of these in one of the $K$ colors of his paint cans. For aesthetic reasons, any two adjacent balls must be painted in different colors. Find the number of the possible ways to paint the balls. ## Constraints * $1≦N≦1000$ * $2≦K≦1000$ * The correct answer is at most $2^{31}-1$. ## Input The input is given from Standard Input in the following format: $N$ $K$ [samples]

Samples

Input #1

2 2

Output #1

2

We will denote the colors by $0$ and $1$. There are two possible ways: we can either paint the left ball in color $0$ and the right ball in color $1$, or paint the left in color $1$ and the right in color $0$.

Input #2

1 10

Output #2

10

Since there is only one ball, we can use any of the ten colors to paint it. Thus, the answer is ten.

API Response (JSON)

{
  "problem": {
    "name": "Painting Balls with AtCoDeer",
    "description": {
      "content": "There are $N$ balls placed in a row. AtCoDeer the deer is painting each of these in one of the $K$ colors of his paint cans. For aesthetic reasons, any two adjacent balls must be painted in different ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc046_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There are $N$ balls placed in a row. AtCoDeer the deer is painting each of these in one of the $K$ colors of his paint cans. For aesthetic reasons, any two adjacent balls must be painted in different ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments