B - HeHe【规律+积性函数+筛法求素数】

Discription
In the equation X^2≡X(mod N) where x∈[0,N-1], we define He[N] as the number of solutions.
And furthermore, define HeHe[N]=He[1]*……*He[N]
Now here is the problem, write a program, output HeHe[N] modulo M for a given pair N, M.

Input
First line: an integer t, representing t test cases.
Each test case contains two numbers N (1<=N<=10^7) and M (0<M<=10^9) separated by a space.

Output
For each test case, output one line, including one integer: HeHe[N] mod m.

Sample Input
1
2 3

Sample Output
2

题意
给定一个同余式X^2≡X(mod N)即X^2和X余数modN相同，[0,N-1]范围内成立的X的个数为He[N]
HeHe[N]=He[1]*……*He[N]
求解HeHe[N]modM的值

思路
这是道规律题，规律太难找了，我找了好久都没找到。打表如下：

会发现HeHe[N]是2^p的形式出现。
p=[N/(<n的素数)]的和
eg：HeHe[2]=2^(2/2);
HeHe[3]=2^(3/2+3/3);
HeHe[4]=2^(4/2+4/3);
……

AC代码

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 10000000+ 5;
bool prime[N];//prime[i]表示i是不是质数
int p[N], tot;//p[N]用来存质数

void init()
{
    for(int i = 2; i < N; i ++)
        prime[i] = true;//初始化为质数
    for(int i = 2; i < N; i++)
    {
        if(prime[i])
            p[tot ++] = i;//把质数存起来
        for(int j = 0; j < tot && i * p[j] < N; j++)
        {
            prime[i * p[j]] = false;
            if(i % p[j] == 0)
                break;//保证每个合数被它最小的质因数筛去
        }
    }
}

long long qmi(long long m, long long k, long long p)
{
    long long res = 1 % p, t = m;
    while (k)
    {
        if (k&1) res = res * t % p;
        t = t * t % p;
        k >>= 1;
    }
    return res;
}

int t;
int n,m;

int main()
{
    init();
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&n,&m);
        LL ans=0;
        for(int i=0;i<tot&&p[i]<=n;i++)
        {
            ans+=n/p[i];
            //cout<<ans<<endl;
            //cout<<p[i]<<endl;
        }
        ans=qmi(2,ans,m);
        printf("%lld\n",ans);
    }
    return 0;
}