https://cn.vjudge.net/problem/POJ-2154
要取模所以把除n提到指数上
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
//const int mod=1e9+7;
int power(int x,int n,int mod)
{
int ans=1;
x%=mod;
while(n)
{
if(n&1) ans=ans*x%mod;
x=x*x%mod;
n>>=1;
}
return ans;
}
bool vis[maxn];
int prime[maxn];
int tot;
void getP()
{
tot=0;
for(int i=2;i<maxn;i++)
{
if(!vis[i])
{
prime[tot++]=i;
for(int j=i+i;j<maxn;j+=i) vis[j]=1;
}
}
}
int n,m,p;
int euler(int n)
{
int ans=n;
for(int i=0;prime[i]*prime[i]<=n;i++)
{
if(n%prime[i]==0)
{
ans-=ans/prime[i];
while(n%prime[i]==0) n/=prime[i];
}
}
if(n>1) ans-=ans/n;
return ans;
// int ans=n;
// for(int i=2;i*i<=n;i++)
// {
// if(n%i==0)
// {
// ans-=ans/i;
// while(n%i==0) n/=i;
// }
// }
// if(n>1) ans-=ans/n;
// return ans;
}
vector<int>fac;
void getyin(int n)
{
for(int i=1;i*i<=n;i++)
{
if(n%i==0)
{
fac.pb(i);
if(i*i!=n) fac.pb(n/i);
}
}
}
int polya(int n,int m)
{
int ans=0;
for(int i=0;i<fac.size();i++)
{
int eu=euler(n/fac[i])%p;
ans=(ans+eu*power(m,fac[i]-1,p)%p)%p;
}
return ans;
}
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
getP();
int T;
cin>>T;
while(T--)
{
fac.clear();
cin>>n>>p;
m=n;
fac.clear();
getyin(n);
int ans=polya(n,m);
cout<<ans<<endl;
}
return 0;
}
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
//const int mod=1e9+7;
int power(int x,int n,int mod)
{
int ans=1;
x%=mod;
while(n)
{
if(n&1) ans=ans*x%mod;
x=x*x%mod;
n>>=1;
}
return ans;
}
//
//
//bool vis[maxn];
//int prime[maxn];
//void getP()
//{
// tot=0;
// for(int i=2;i<maxn;i++)
// {
// if(!vis[i])
// {
// prime[tot++]=i;
// for(int j=i+i;j<maxn;j+=i) vis[j]=1;
// }
// }
//}
int n,m,p;
int euler(int n)
{
int ans=n;
for(int i=2;i*i<=n;i++)
{
if(n%i==0)
{
ans-=ans/i;
while(n%i==0) n/=i;
}
}
if(n>1) ans-=ans/n;
return ans;
}
vector<int>fac;
void getyin(int n)
{
for(int i=1;i*i<=n;i++)
{
if(n%i==0)
{
fac.pb(i);
if(i*i!=n) fac.pb(n/i);
}
}
}
int polya(int n,int m)
{
int ans=0;
for(int i=0;i<fac.size();i++)
{
int eu=euler(n/fac[i])%p;
ans=(ans+eu*power(m,fac[i]-1,p)%p)%p;
}
return ans;
}
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
int T;
cin>>T;
while(T--)
{
fac.clear();
cin>>n>>p;
m=n;
fac.clear();
getyin(n);
int ans=polya(n,m);
cout<<ans<<endl;
}
return 0;
}