Collecting bees
You’d like to collect
n bees into k jars. As the bees are small, you don’t notice the difference between them. So, the only difference is made when there are different numbers of bees in different jars.How many different ways are there to collect
n bees into k jars?
Input
The first line of the input contains two integers
n and k (1 ≤ n, k ≤ 30).Output
The program should print the different number of ways to collect the bees.
Examples
Input | Output |
3 1 | 1 |
5 2 | 6 |
Explanation
- The only way is to keep all the bees in one jar
- (0, 5) (1, 4) (2, 3) (3, 2) (4, 1) (5, 0) ⇒ 6 different ways
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB