题目链接:http://codeforces.com/gym/101955/problem/J
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=25;
int maps[maxn][maxn];
int n,m;
int main(){
///for(int i=0;i<maxn;++i) maps[i][0]=1;
for(int i=1;i<maxn;++i)
{
maps[i][0]=maps[i][i]=1;
for(int j=1;j<i;++j)
maps[i][j]=maps[i-1][j-1]+maps[i-1][j];
}
int t;scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
printf("%d\n",maps[n][m]);
}
return 0;
}