My solutions: 0.015

# include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
    ll l, r, kol, i, j, N = 1e6;
    cin >> l >> r;
    kol = r - l + 1;

    ///Resheto
    vector<char> prime (N+1, true);
    prime[0] = prime[1] = false;
    for (ll i=2; i<=N; ++i)
        if (prime[i])
            if (i * 1ll * i <= N)
                for (ll j=i*i; j<=N; j+=i)
                    prime[j] = false;

    ll t, p, s, kol2 = 0;

    for(i = 2; i <= min(N, r); i++)
    {
        if(prime[i])
        {
            s = i * i;
            t = 1;
            p = 0;
            while(1)
            {
                t *= s;
                p += 2;
                if(t > r)
                    break;
                if(t >= l)
                {
                    if(prime[p + 1])
                        kol2++;
                }
            }
        }
    }

    cout << kol - kol2;
    return 0;
}

Delete this please