// http://www.spoj.com/problems/MARBLES/
#include <iostream>
using namespace std;
// 假设30个位置
void f() {
int n, k;
cin >> n >> k;
long double result;
n--;
k--;
result = 1.0;
for(double i=0.0; i<k; i+=1.0) {
result*=(n-i)/(k-i);
}
cout << (long long int)(result + (long double)0.5) << endl;
}
int main() {
int t;
cin >> t;
while (t--) {
f();
}
}
SPOJ MARBLES
最新推荐文章于 2018-03-25 06:49:02 发布