推出公式来就是水题。
S(n,k) = C(n,0)+10^k*C(n,1)+10^2k*C(n,2)+.... ...+10^nk*C(n,n)
10^k*S(n,k) = 10^k*C(n,0)+10^2k*C(n,1)+10^3k*C(n,2)+.... ...+10^(n+1)k*C(n,n)
两式求和可得 S(n, k) + 10^k*S(n, k) = S(n+1, k)
即 S(n, k) = (1+10^k)^n
至此题目就转化为求 (1+10^k)^n%m
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
long long bigpow(int x,int n, int M){
long long res=1,temp=x%M;
while(n){
if(n&1){
res=(res*temp)%M;
}
temp=(temp*temp)%M;
n>>=1;
}
return res;
}
int main(){
//freopen("1.txt", "r", stdin);
int T, n, k, m;
scanf("%d", &T);
while(T--){
scanf("%d%d%d", &n, &k, &m);
long long ans=bigpow(10, k, m);
ans=(ans+1)%m;
ans=bigpow(ans, n, m);
printf("%d\n", ans);
}
return 0;
}