Basic arrangement and combination of hdu 2519 New Year gala

Basic arrangement and combination of hdu 2519 New Year gala
Freshman galaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission (s): 9203 Accepted Submission (s): 3230


When Problem Description started, hangdian welcomed many new students. ACMer wants to prepare a program for new students. There are many people signing up for the show, up to N, but you only need to select M from these N people. How many options are there?
The first line of Input data contains a positive integer T, followed by T groups of data, each group occupies a row.
Each group of data contains two integers (N, 1 <= N <= 30) and M (0 <= M <= 30)

Output each group of data outputs an integer. Each Output occupies one row.
Sample Input

53 25 34 43 68 0

Sample Output

310101

# Include

 
  
# Include

  
   
Using namespace std; int main () {int T; cin> T; while (T --) {int n, m; cin> n> m; if (n