P3172 [CQOI2015]选数

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

反思：求一段区间gcd==k，将区间除k就会变成求新的区间gcd==1 ！；这段区间的gcd不会超过r-l  ！

定义dp[i]为gcd==i的方案数；总的就是i倍数的个数x的n次方，还要减掉全部相同数字的数目x；如果能取到1，都是1是可行的所以加一；而计算dp[i]时总方案时包含i倍数方案的，所以减掉2i，3i...的方案数；

 

 

#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=1e5+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 sum[maxn+10];
int a,b,c,d,k;
void Moblus()
{
    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];
            }
        }
    }

    for(int i=1;i<=maxn;i++) sum[i]=sum[i-1]+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;
}
ll dp[maxn];
int main()

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

    int n,k,l,r;
    cin>>n>>k>>l>>r;
    r=r/k;
    l=(l%k)?l/k+1:l/k;
    for(int i=r-l;i>=1;i--)
    {
        int R=r/i;
        int L=(l%i)?l/i+1:l/i;
        int t=R-L+1;
        dp[i]=(power(t,n)-t%mod+mod)%mod;
        for(int j=2;j*i<=r-l;j++)
        {
            dp[i]=(dp[i]-dp[j*i]+mod)%mod;
        }
    }
    if(l==1) dp[1]++;
    dp[1]%=mod;
    cout<<dp[1]<<endl;
    return 0;
}