Put the Apples

Put the Apples

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 25550		Accepted: 16249

Description

Put m the same apples on n the same plate, allow some plates to be empty, ask how many different ways? (denoted by k) 5,1,1 and 1,5,1 are the same kind of sub-method.

Input

The first line is the number of test data t (0 <= T <= 20). Each of the following lines contains two integers m and n, separated by a space. 1<=m,n<=10.

Output

For each set of data entered M and N, the corresponding k is output in one line.

Sample Input

17 3

Sample Output

8

Code:

<pre name= "code" class= "Java" >import Java.util.scanner;public class Main {public        static int Test (int m, int n) {        if (m = = 0 | | n = = 1) {            return 1;         }        if (n > M) {            return Test (M, m);        } else {            return test (M, n-1) + Test (m-n, n);        }    }    public static void Main (string[] args) {        Scanner cin = new Scanner (system.in);        int i = Cin.nextint ();        for (int j = 0; J < i; J + +) {            int m = Cin.nextint ();            int n = cin.nextint ();            System.out.println (Test (M, n));        }        Cin.close ();    }}