[scu 4423] Necklace

4423: Necklace

Description

baihacker bought a necklace for his wife on their wedding anniversary.
A necklace with N pearls can be treated as a circle with N points where the
distance between any two adjacent points is the same. His wife wants to color
every point, but there are at most 2 kinds of color. How many different ways
to color the necklace. Two ways are said to be the same iff we rotate one
and obtain the other.

Input

The first line is an integer T that stands for the number of test cases.
Then T line follow and each line is a test case consisted of an integer N.

Constraints:
T is in the range of [0, 4000]
N is in the range of [1, 1000000000]
N is in the range of [1, 1000000], for at least 75% cases.

Output

For each case output the answer modulo 1000000007 in a single line.

Sample Input

6
1
2
3
4
5
20

Sample Output

2
3
4
6
8
52488

Author

baihacker

疯狂地模板题，受不了，比赛的时候连这个定理都没听过，还傻乎乎地想了好久，晕死- -

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
#define ll long long
#define N 32000

ll tot;
ll prime[N+];
bool isprime[N+];
ll phi[N+];
void init()
{
    memset(phi,-,sizeof(phi));
    memset(isprime,,sizeof(isprime));
    tot=;
    phi[]=;
    isprime[]=isprime[]=;
    for(ll i=;i<=N;i++)
    {
        if(isprime[i])
        {
            prime[tot++]=i;
            phi[i]=i-;
        }
        for(ll j=;j<tot;j++)
        {
            if(i*prime[j]>N) break;
            isprime[i*prime[j]]=;
            if(i%prime[j]==)
            {
                phi[i*prime[j]]=phi[i]*prime[j];
                break;
            }
            else
                phi[i*prime[j]]=phi[i]*(prime[j]-);
        }
    }
}
ll euler(ll n)
{
    if(n<=N) return phi[n];
    ll ret=n;
    for(ll i=;prime[i]*prime[i]<=n;i++)
    {
        if(n%prime[i]==)
        {
            ret-=ret/prime[i];
            while(n%prime[i]==) n/=prime[i];
        }
    }
    if(n>) ret-=ret/n;
    return ret;
}
ll quickpow(ll a,ll b,ll MOD)
{
    a%=MOD;
    ll ret=;
    while(b)
    {
        if(b&) ret=(ret*a)%MOD;
        a=(a*a)%MOD;
        b>>=;
    }
    return ret;
}
ll exgcd(ll a,ll b,ll& x, ll& y)
{
    if(b==)
    {
        x=;
        y=;
        return a;
    }
    ll d=exgcd(b,a%b,y,x);
    y-=a/b*x;
    return d;
}
ll inv(ll a,ll MOD)
{
    ll x,y;
    exgcd(a,MOD,x,y);
    x=(x%MOD+MOD)%MOD;
    return x;
}
void solve(ll n,ll MOD)
{
    ll i,t1,t2,ans=;
    for(i=;i*i<=n;i++)
    {
        if(n%i==)
        {
            if(i*i!=n)
            {
                t1=euler(n/i)%MOD*quickpow(,i,MOD);
                t2=euler(i)%MOD*quickpow(,n/i,MOD);
                ans=(ans+t1+t2)%MOD;
            }
            else
                ans=(ans+euler(i)*quickpow(,i,MOD))%MOD;
        }
    }
    ans=ans*inv(n,MOD)%MOD;
    printf("%d\n",ans);
}
int main()
{
    init();
    ll T,n;
    ll MOD=;
    scanf("%lld",&T);
    while(T--)
    {
        scanf("%lld",&n);
        solve(n,MOD);
    }
    return ;
}