另一个版本的BZOJ 3884
AC代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll quickmod(ll a,ll b,ll m){
ll ans=1;
while(b){
if(b&1) ans=(ans*a)%m;
b>>=1;
a=a*a%m;
}
return ans;
}
ll phi(ll x){
ll ans=x;
for(ll i=2;i*i<=x;i++){
if(x%i==0){
ans=ans/i*(i-1);
while(x%i==0) x/=i;
}
}
if(x>1) ans=ans/x*(x-1);
return ans;
}
ll dfs(ll p,ll x){
if(x==1)
return 0;
if(x==p)
return 0;
ll y=0;
while(x%p==0){
x/=p;
++y;
}
return quickmod(p,(dfs(p,phi(x))-y%phi(x)+phi(x))%phi(x),x)*pow(p,y);
}
int main(){
ll p,m;
int flag=0;
while(cin>>p>>m){
if(flag){
cout<<endl;
}
flag=1;
ll x=m;
for(ll i=1;i<x;++i)
m=m*i;
cout<<dfs(p,m)%m<<endl;
}
}