Codeforces Beta Round #95 (Div. 2) C The World is a Theatre（组合数）

这道题学会了求组合数的技巧~~

下面是模板：

	long long c[100][100];
	clr(c,0);
	c[0][0] = 1;
	for(int i = 1;i <= 40;i++) {
		c[i][0] = 1;
		for(int j = 1;j <= i;j++) {
			c[i][j] = c[i-1][j] + c[i-1][j-1];
		}
	}

c[i][j]就是c（m,n）;

这道题的一直wa就是爆了 longlong

#include<bits/stdc++.h>
using namespace std;
#define clr(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define fir first
#define se second
#define LL long long
typedef pair<int,int> pii;
const double eps = 0.0000001;
const int inf = 1e9+7;
const LL mod = 1e9+7;
const int maxn = 1e6+5;

LL c[100][100];
int vis[100][100];

int main() {
	LL n,m,t;
	cin>>n>>m>>t;
	clr(c,0);
	c[0][0] = 1;
	for(int i = 1;i <= 40;i++) {
		c[i][0] = 1;
		for(int j = 1;j <= i;j++) {
			c[i][j] = c[i-1][j] + c[i-1][j-1];
		}
	}
	LL ans = 0;
	clr(vis,0);
	for(int i = 4;i <= t-1 && i <= n;i++) {
		ans += c[n][i]*c[m][t-i];
		vis[i][t-i] = 1;
	}
	for(int i = 1;i <= t-4 && i <= m;i++) {
		if(!vis[t-i][i])
			ans += c[m][i]*c[n][t-i];
	}
	cout<<ans<<endl;
}