POJ 1664 putting apples

Put the Apples

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 25785		Accepted: 16403

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

Source

[email protected]


how can I meet and put an apple, feel myself Meng da. simple recursion, divided into each disk can be put one and at least one plate is empty.

Import java.util.*;p Ublic class Main {public static int f (int m,int n) {if (m<0) return 0;if (m==0| | N==1) return 1;//m=0 each one is put in place, N=1 last only a plate return F (m-n,n) +f (m,n-1);} public static void Main (string[] args) {Scanner scan=new Scanner (system.in), int t=scan.nextint (); for (int i=0;i<t;i++ ) {int m=scan.nextint (); int n=scan.nextint (); System.out.println (f (m,n));}}}