单个欧拉函数模板 p4139欧拉降幂

ll _phi(ll x)
{
    ll ans=x,tp=sqrt(x);
    for(ll i=2;i<=tp;++i)
        if(x%i==0)
        {
            ans=ans-ans/i;
            while(x%i==0)x/=i;
        }
    if(x>1)ans=ans-ans/x;
    return ans;
}

p4139

//#pragma GCC optimize(3,"Ofast","inline")
//#include<unordered_map>
//#include<unordered_set>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<functional>
#include<cstring>
#include<string>
#include<cstdlib>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<stack>
#include<vector>
#include<sstream>
#include<list>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f;
int mod=1000000007;
const int N=2e3+10;
const int maxn=1e7+10000;
int prime[maxn],phi[maxn],isprime[maxn];
int num;
bool jud[maxn];
void getphi(int n)
{
    memset(prime,0,sizeof(prime));
    memset(isprime,1,sizeof(isprime));
    phi[1]=1;
    for(int i=2;i<=n;i++)
    {
        if(isprime[i])
        {
            phi[i]=i-1;
            prime[num++]=i;
        }
        for(int j=0;j<num&&i*prime[j]<=n;j++)
        {
            isprime[i*prime[j]]=0;
            if(i%prime[j]==0){phi[i*prime[j]]=phi[i]*prime[j];break;}
            else phi[i*prime[j]]=phi[i]*phi[prime[j]];
        }
    }
}

ll qpow(ll a,ll b,ll p)
{
    ll ans=1%p;
    while(b!=0)
    {
        if(b&1)
        {
            ans=(ans%p*a%p)%p;
        }
        a=(a*a)%p;
        b>>=1;
    }
    return ans;
}

ll solve(ll a,ll b,ll p){
	if(p==1)return 0;
	if(b==0)return 1;
	ll P=solve(a,b-1,phi[p]);
	if(P<phi[p]&&P) return qpow(a,P,p);
	else return qpow(a,P+phi[p],p);
}
int main()
{
	getphi(10000100);
	int t;scanf("%d",&t);
	while(t--){
		ll a,b,mod;scanf("%lld",&mod);ll ans;
		ans=solve(2,1000000000,mod);
		printf("%lld\n",ans%mod);
	}
	return 0;
}