#188. 【UR #13】Sanrd

http://uoj.ac/problem/188 

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

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e6+9;
const int maxm=5e6+9;
const int mod=1e9+7;
const int INV6=166666668;
const int INV2 = 5e8 + 4;

ll n,sqrtn,prm[maxn],sump[maxn],cnt,g[maxn];
bool v[maxn];

void getP(int n)
{
    cnt=0;
    for(int i=2;i<=n;i++)
    {
        if(!v[i])
        {
            prm[++cnt]=i;
            sump[cnt]=(sump[cnt-1]+i)%mod;
       }
        for(int j=1;j<=cnt&&prm[j]*i<=n;j++)
        {
            v[prm[j]*i]=1;
            if(i%prm[j]==0) break;
        }
    }
}

ll val[maxn];
int id1[maxn],id2[maxn];

inline int get_id(ll x,ll n)
{
    return ((x<=sqrtn)?id1[x]:id2[n/x]);
}

ll getS(ll x,ll y,ll n)
{
    if(x<prm[y]||x<=1) return 0;
    int k=get_id(x,n);
    ll res=prm[y-1]*(g[k]-(y-1));
    for(int i=y;i<=cnt&&(ll)prm[i]*prm[i]<=x;++i)
    {
        ll now=prm[i],nex=prm[i]*prm[i];
        for(int j=1;nex<=x;++j,now=nex,nex*=prm[i])
        {
            res=(res+getS(x/now,i+1,n)+prm[i]);

        }
    }
    return res;
}


ll solve(ll n)
{
    sqrtn=sqrt(n);
    getP(sqrtn);
    int tot=0;
    for(ll i=1,j;i<=n;i=j+1)
    {
        j=n/(n/i);
        ll w=n/i;
        val[++tot]=w;
        if(w<=sqrtn) id1[w]=tot;
        else id2[n/w]=tot;

        g[tot]=w-1;
        //cout<<g[tot]<<" ";

    }
    for(int j=1;j<=cnt;j++)
    {
        for(int i=1;i<=tot&&(ll)prm[j]*prm[j]<=val[i];++i)
        {
            int k=get_id(val[i]/prm[j],n);

            g[i]-=g[k]-j+1;
            //cout<<g[i]<<" ";

        }
    }

    return getS(n,1,n);

}

int main()
{
    //FAST_IO;

    ll r,l;
    read(l);
    read(r);


    printf("%lld\n",solve(r)-solve(l-1));

    return 0;
}