[1229] Timo's Mushroom
- 时间限制: 1000 ms 内存限制: 65535 K
- 问题描述
-
Timo is a hero of LOL. Etond pretty like this hero too.
Timo can place the Mushroom in the road.
Timo have N (0 < N < 100) Mushrooms, And there are M (0 < M < 100) grass over here.
Timo want to place at least K (0 < k < 100) Mushrooms in each grass.
Now Timo can't count the all sulutions, please write a program to help Timo count all sulutions.
If there are no sulutions here print "-1".
- 输入
-
There are muticase here.
For each case, there are 3 integers. n, m, k. - 输出
-
For each case, count all the sulutions, Timo can place.
- 样例输入
-
10 5 2 10 5 1
- 样例输出
-
1 126
- 提示
-
无
- 来源
-
monkeyde17
- 操作
-
