AtCoder Beginner Contest 185
翻译中…
Problem Statement
翻译中…
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
翻译中…
Output
翻译中…
Print the number of ways to do the division.
翻译中…
样例
Input #1
12
Output #1
1
There is only one way: to cut the bar into $12$ bars of length $1$ each.
Input #2
13
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
17
Output #3
4368
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。