传送门
sqrt(n)求欧拉函数的值,还要再用素数塞优化一下,还有一些细节
代码:
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define debug(x) cout<<x<<endl
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
typedef long long ll;
using namespace std;
const int MAXN=1e6+50;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
//::iterator it;
const int Mod=9937;//不是质数
ll quick(ll a,ll b){
ll ans=1;
while(b){
if(b&1)ans=ans*a%Mod;
a=a*a%Mod;
b/=2;
}
return ans%Mod;
}
ll gcd(ll a,ll b){
return b?gcd(b,a%b):a;
}
ll top,prime[MAXN];
bool b[MAXN];
void make_prime()
{
top=0;
b[0]=b[1]=false;
for(int i=2;i<=MAXN;i++)
{
if(!b[i]) prime[++top]=i;
for(int j=1;j<=top&&i*prime[j]<=MAXN;j++)
{
b[i*prime[j]]=true;
if(i%prime[j]==0)
break;
}
}
}
ll phi(ll n)
{
ll ans=n;
for(ll i=1;prime[i]*prime[i]<=n&&i<=top;i++)
{
if(n%prime[i]==0)
{
ans=ans/prime[i]*(prime[i]-1);
while(n%prime[i]==0)n/=prime[i];
}
}
if(n>1)ans=ans/n*(n-1);
return ans;
}
int main()
{
std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
make_prime();
ll n,k;
while(cin>>n>>k){
//if(n==0&&k==0)break;
ll ans=0;
int lim=sqrt(n);//用i*i<=n会tle,时间竟然差那么多
for(int i=1;i<=lim;i++){ //旋转
if(n%i==0){
ans=(ans+phi(n/i)*quick(k,i)%Mod)%Mod;
if(n/i!=i){
ans=(ans+phi(i)*quick(k,n/i)%Mod)%Mod;
}
}
}
/*if(n&1){ //翻转
ans+=n*quick(k,(n+1)/2);
}else {
ans+=n/2*quick(k,n/2)+n/2*quick(k,2+(n-2)/2);
}*/
ll p;
for(int i=0;i<Mod;i++)if(ans==(i*(n%Mod)%Mod)){
p=i;
break;
}
cout<<p<<endl;
}
return 0;
}
/*
*/