NOIP 2011 Day2 T1 计算系数

#include<cstdio>
#include<iostream>
#include<cmath>
#include<iomanip>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#define LL long long
using namespace std;
const int mod=10007;
int a,b,k,n,m,ans,cnt;
int f[1005][1005];
int fast_pow(int x,int y)
{
if (y==0)  return 1;
int t=fast_pow(x,y/2);
t=(LL)t*t%mod;
if (y&1)  t=(LL)t*x%mod;//here
return t;
}
int main ()
{
freopen ("factor.in","r",stdin);
//freopen ("factor.out","w",stdout);
scanf ("%d%d%d%d%d",&a,&b,&k,&n,&m);
a%=mod;b%=mod;
ans=(LL)fast_pow(a,n)*fast_pow(b,m)%mod;
f[1][1]=1;f[1][2]=1;cnt=2;
for (int i=2;i<=k;i++)
{
++cnt;
for (int j=1;j<=cnt;j++)
f[i][j]=(f[i-1][j-1]+f[i-1][j])%mod;
}
printf ("%d",f[k][n+1]*ans%mod);
return 0;
}