HDU

打表

#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;typedef long long ll;const int maxn = 1000000, INF = 0x3f3f3f3f;int T, n;ll C[33][33];void init() {    C[1][0] =  C[1][1] = 1;    for(int i = 2; i < 33; ++i) {        C[i][0] = 1;        for(int j = 1; j <= i; ++j) {            C[i][j] = C[i-1][j] + C[i-1][j-1];        }    }}int a, b;int main() {    init();    cin >> T;    while(T--) {        cin >> a >> b;        cout << C[a][b] << endl;    }    return 0;}