Code Vs 1137 计算系数

/*二项式定理:c(n,k)*a^n-k*b^k; 杨辉三角：c(n,k)=c(n-1,k-1)+c(n-1,k-1); */#include<cstdio>#include<cstdlib>#include<cstring>using namespace std;const int mod=10007;int f[1010][1010];int a,b,k,n,m;int ans=0;void solve(){int temp=a;for(int i=1; i<=n-1; i++) a=(temp*a)%mod;temp=b;for(int i=1; i<=m-1; i++) b=(temp*b)%mod;ans=(a*b)%mod;ans=(ans*f[k][n])%mod;printf("%d", ans);}void init(){scanf("%d %d %d %d %d", &a, &b, &k, &n, &m);a=a%mod;b=b%mod;memset(f, 0, sizeof(f));f[1][0]=1;f[1][1]=1;for(int i=2; i<=k; i++){f[i][0]=1;for(int j=1; j<=i-1; j++){f[i][j]=(f[i-1][j]+f[i-1][j-1])%mod;}f[i][i]=1;}}int main(){init();solve();return 0;}