hdu 4506 小明系列故事——师兄帮帮忙

快速幂取模

#include<iostream>#define maxn 10010using namespace std;long long a[maxn],b[maxn],n,t,k;long long mod=1000000007;long long result(long long a,long long b,long long m){long long d=1,t=a;while(b>0){if(b%2) d=(d*t)%m;b/=2;t=(t*t)%m;}return d;}void input(){cin>>n>>t>>k;for(int i=1;i<=n;i++) cin>>a[i];}void solve(){long long p=result(k,t,mod);t%=n;for(int i=1;i<=n;i++){int x=i-t;if(x<1) x+=n;b[i]=p%mod*a[x]%mod;}}void output(){cout<<b[1];for(int i=2;i<=n;i++) cout<<" "<<b[i];cout<<endl;}int main(){cin.sync_with_stdio(false);int t;cin>>t;while(t--){input();solve();output();}return 0;}