快速幂64pts求调QwQ
查看原帖
快速幂64pts求调QwQ
310054
WITCHER2077楼主2023/3/10 17:23
#include<bits/stdc++.h>
#define int long long
using namespace std;
int ksm(int a,int b,int p)
{
	if(b==1)return a;
	int t=ksm(a,b/2,p);
	if(b%2==0)
	{
		return t*t%p;
	}
	else return t*t*a%p;
}
signed main()
{
	int ans,a,b,p;
	scanf("%lld%lld%lld",&a,&b,&p);
	ans=ksm(a,b,p);
	printf("ll%d^%lld mod %lld=%lld",a,b,p,ans);
	//a^b mod p=s
	return 0;	
}
2023/3/10 17:23
加载中...