组合数和杨辉三角

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int Max=1000,mod=10000007;
int f[1005][1005],m,n;
void Init(){    ///组合数打表int i,j;for(i=0;i<=Max;i++){f[0][i]=0;f[i][0]=1;}for(i=1;i<=Max;i++){for(j=1;j<=Max;j++){f[i][j]=(f[i-1][j]+f[i-1][j-1])%mod;}}
}
int main() {int i,j,k;int ans=0;scanf("%d %d",&m,&n);Init();printf("%d\n",f[m][n]);return 0;
}