题目
思路
直接二项式定理即可(不会请出门左转BDFS)
code:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
long long ksm(long long x,long long y)
{
long long ans=1;
while (y)
{
if (y&1) ans=ans*x%10007;
x=x*x%10007;
y>>=1;
}
return ans;
}
long long a,b,k,n,m,c[1001][1001];
int main()
{
cin>>a>>b>>k>>n>>m;
c[0][0]=c[0][1]=1;
for (int i=1;i<=k;i++)
{
c[i][0]=c[i][i]=1;
for (int j=1;j<i;j++) c[i][j]=(c[i-1][j]+c[i-1][j-1])%10007;
}
cout<<c[k][m]%10007*ksm(a,n)%10007*ksm(b,m)%10007;
return 0;
}