Fantasy of a Summation(快速幂+取模)

最新推荐文章于 2021-07-09 10:54:52 发布

MOGU漠沽

最新推荐文章于 2021-07-09 10:54:52 发布

阅读量200

点赞数

本文链接：https://blog.csdn.net/weixin_43925900/article/details/103949255

版权

题意：给4个数n,k,mod,sum。n (1 ≤ n ≤ 1000), K (1 ≤ K < 2³¹), MOD (1 ≤ MOD ≤ 35000).求k*n^k-1*sum.
解题思路：开long long,开int的话就会莫名其妙地炸掉。用快速幂求出n^k-1.
错误原因：被卡int呜呜呜呜呜。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define LL long long
#define MT(a,b) memset(a,b,sizeof(a))
const int maxn=2E5+5;
const int ONF=-0x3f3f3f3f;
const int INF=0x3f3f3f3f;
LL q_pow(int n,LL k,int MOD){
    LL ans=1;
    n%=MOD;
    while (k!=0){
        if (k&1) ans=(ans%MOD*n%MOD)%MOD;
        k>>=1;
        n=(n%MOD*n%MOD)%MOD;
    }
    return ans%MOD;
}
int main (){
    int t,n,MOD;
    LL k,tmp,sum;
    scanf ("%d",&t);
    for (int j=1;j<=t;j++){
        scanf("%d%lld%d",&n,&k,&MOD);
        sum=0;
        for (int i=1;i<=n;i++){
            scanf("%lld",&tmp);
            sum=(sum%MOD+tmp%MOD+MOD)%MOD;
            sum%=MOD;
        }
        tmp=q_pow(n,(k-1),MOD);
        tmp=((tmp%MOD*k%MOD)%MOD*sum%MOD)%MOD;
        printf("Case %d: %lld\n",j,tmp);
    }
    return 0;
}