Problem B
Combinations, Once Again
Input: Standard Input
Output: Standard Output
Time Limit: 2 Seconds
Input
Output
For each test case, print the test case number. And for each query number r, print the number of different groups that can be formed if r objects are taken from the given n objects. You can assume that for all input cases, the output will always fit in a 64-bit unsigned integer and (0<=r<=n).
5 2 1 2 3 4 5 2 1 4 1 1 2 3 4 2 0 0 |
Case 1: 10 5 Case 2:
6 |
Problemsetter: Monirul Hasan, Member of Elite Problemsetters' Panel