P3704 [SDOI2017]数字表格

https://www.luogu.org/problemnew/show/P3704

继续熟悉莫比乌斯~~ 

 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\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 eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

bool check[maxn+10];
int prime[maxn+10];
int mu[maxn+10];
ll f[maxn+10];
ll inv[maxn+10];
ll F[maxn+10];
int n,m;

void Mobius()
{
    mem(check,0);
    mu[1]=1;
    int tot=0;
    for(int i=2;i<=maxn;i++)
    {
        if(!check[i])
        {
            prime[tot++]=i;
            mu[i]=-1;
        }
        for(int j=0;j<tot;j++)
        {
            if(i*prime[j]>maxn) break;
            check[i*prime[j]]=true;
            if(i%prime[j]==0)
            {
                mu[i*prime[j]]=0;
                break;
            }
            else
            {
                mu[i*prime[j]]=-mu[i];
            }
        }
    }

}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        n>>=1;
        x=x*x%mod;
    }
    return ans;
}

void init()
{

    f[1]=1;
    f[0]=0;
    inv[1]=1;

    for(int i=2;i<=maxn;i++) f[i]=(f[i-1]+f[i-2])%mod;
    for(int i=2;i<=maxn;i++) inv[i]=power(f[i],mod-2);
    for(int i=0;i<=maxn;i++) F[i]=1;

    Mobius();

    for(int i=1;i<=maxn;i++)
    {
        if(!mu[i]) continue;
        for(int j=i;j<=maxn;j+=i)
        {
            ll k=0;
            if(mu[i]==1) k=f[j/i];
            else k=inv[j/i];
            F[j]=1LL*F[j]*k;
            F[j]%=mod;
        }
    }

    for(int i=2;i<=maxn;i++) F[i]=(1LL*F[i]*F[i-1])%mod;//前缀积
}
int main()

{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    init();
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        ll ans=1;
        if(n>m) swap(n,m);
        for(int i=1,r;i<=n;i=r+1)
        {
            r=min(n/(n/i),m/(m/i));
            ll di=(1LL*F[r]*power(F[i-1],mod-2))%mod;//F[r]/F[i-1]
            ans=ans*power(di,1LL*(n/i)*(m/i)%(mod-1))%mod;//费马小定理
            //cout<<ans<<" ";
        }
        cout<<(ans%mod+mod)%mod<<endl;
    }
    return 0;
}