666: Put the Apples

The description puts the M-same apple on n identical plates, allowing some plates to be left empty, asking how many different ways are there? (denoted by k) 5,1,1 and 1,5,1 are the same kind of sub-method. The first line of input 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 to each set of data input m and n, with a row to output the corresponding K. Sample input

17 3

Sample output

8

source [email protected]

1#include <cstdio>2 using namespacestd;3 intFintMintN)4 {5     if(n==1|| m==0)return 1; 6     if(n>m)returnf (m,m);7     returnF (m,n-1) +f (M-n,n);8 }9 Ten intMain () One { A     intnum; -scanf"%d",&num); -      while(num--) the     { -         intM,n; -scanf"%d%d",&m,&n); -printf"%d\n", F (m,n)); +     } -  +     return 0; A}

666: Put the Apples