10533-Digit Primes

#include<iostream>
#include<bits/stdc++.h>
using namespace  std;

const int N=1000000;

int val[1000001]={0};
bool prime[1000001];

void Sieve(int n)
{
    memset(prime, true, sizeof(prime));
    int c=0;
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*p; i<=n; i += p)
                prime[i] = false;
        }

    }

    // Print all prime numbers
   /* for (int p=2; p<=n; p++)
       if (prime[p])
          cout << p << " "; */
}
void digit(){

    for(long long i=2;i<N;i++){
        int sum=0,m;
        int p=i;
        while(p!=0)
            {
            m=p%10;
            sum=sum+m;
            p=p/10;
            }
       if(prime[sum]==true && prime[i])
           val[i]=val[i-1]+1;
        else
            val[i]=val[i-1];

    }


}




int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    //  freopen("in.txt", "r", stdin);
    //  freopen("out.txt", "w", stdout);
     Sieve(N);
     digit();
      int t,n1,n2;
      cin>>t ;
      while(t--){
        cin>>n1>>n2;
        cout<<val[n2]-val[n1-1]<<endl;
      }
    return 0;
}