20201201模拟测试:
1.计算系数
题面:
计算(ax+by)k的an*bm项的系数
题解:
1.二项式定理:Cnk*an*bm
2.递推计算杨辉三角第k行第n+1位乘系数
WA因:快速幂未提前取模
代码:
#include<bits/stdc++.h>
using namespace std;
const int N=10007;
/*long long C(int n,int k){
long long a=1,b=1;
for(int i=n+1;i<=k;i++){
a=a*i%N;
}
for(int i=1;i<=k-n;i++){
b=b*i%N;
}
return a/b;
}*///失败的组合QAQ
long long qpow(int x,int n){
long long res=1;
while(n>0){
if(n&1) res=x*res%N;
x=x*x%N;
n>>=1;
}
return res%N;
}
int a,b,k,n,m;
long long dp[1005][1005];
int main(){
freopen("factor.in","r",stdin);
freopen("factor.out","w",stdout);
scanf("%d%d%d%d%d",&a,&b,&k,&n,&m);
dp[1][1]=dp[1][2]=1;
for(int i=2;i<=k;i++){
for(int j=1;j<=i+1;j++){
dp[i][j]=(dp[i-1][j]+dp[i-1][j-1])%(long long)N;
}
}
printf("%lld",((dp[k][m+1]%N)*qpow(a%N,n)*qpow(b%N,k-n))%N);
return 0;
}
2.汉诺塔
题面:
计算n层汉诺塔移动次数
题解:
(1<<n)-1
WA因:没导出规律,直接写了递归,TLE
代码:
#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
freopen("hanoi.in","r",stdin);
freopen("hanoi.out","w",stdout);
scanf("%d",&n);
printf("%d",(1<<n)-1);
return 0;
}
3.骨牌覆盖
题面:
求覆盖2*n个格子可以有多少种方法
题解:
递推:f[i]=f[i-1]+f[i-2];
一次AC
代码:
#include<bits/stdc++.h>
using namespace std;
long long n,f[100];
int main(){
freopen("domino.in","r",stdin);
freopen("domino.out","w",stdout);
scanf("%lld",&n);
f[1]=1;
f[2]=2;
for(int i=3;i<=n;i++){
f[i]=f[i-1]+f[i-2];
}
printf("%lld",f[n]);
return 0;
}