组合数打表

#include<stdio.h>

#include <limits.h>

#include<iostream>

using namespace std;

const int MAXN = 100;

long long C[MAXN+1][MAXN+1];

void Initial()

{

int i,j;

for(i=0; i<=MAXN; ++i)

{

C[0][i] = 0;

C[i][0] = 1;

}

for(i=1; i<=MAXN; ++i)

{

for(j=1; j<=MAXN; ++j)

C[i][j] = (C[i-1][j] + C[i-1][j-1]);

}

}

long long Combination(int n, int m)

{

return C[n][m];

}

int main()

{

    Initial();

    cout<<Combination(48,12)<<endl;

    cout<<LONG_LONG_MAX;

    return 0;

}