Duodecim Ferra

AtCoder

IDabc185_c

Time2000ms

Memory256MB

Difficulty—

There is an iron bar of length $L$ lying east-west. We will cut this bar at $11$ positions to divide it into $12$ bars. Here, each of the $12$ resulting bars must have a positive integer length. Find the number of ways to do this division. Two ways to do the division are considered different if and only if there is a position cut in only one of those ways. Under the constraints of this problem, it can be proved that the answer is less than $2^{63}$. ## Constraints * $12 \le L \le 200$ * $L$ is an integer. ## Input Input is given from Standard Input in the following format: $L$ [samples]

Samples

Input #1

Output #1

1

There is only one way: to cut the bar into $12$ bars of length $1$ each.

Input #2

Output #2

12

Just one of the resulting bars will be of length $2$. We have $12$ options: one where the westmost bar is of length $2$, one where the second bar from the west is of length $2$, and so on.

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Duodecim Ferra",
    "description": {
      "content": "There is an iron bar of length $L$ lying east-west. We will cut this bar at $11$ positions to divide it into $12$ bars. Here, each of the $12$ resulting bars must have a positive integer length.   Fin",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc185_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There is an iron bar of length $L$ lying east-west. We will cut this bar at $11$ positions to divide it into $12$ bars. Here, each of the $12$ resulting bars must have a positive integer length.  \nFin...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments