From Evernote:

uva 10539

質數篩子

[sourcecode language="cpp"]
//============================================================================
// Name : Almost Prime Numbers.cpp
// Date : 2013 2013/2/2 上午1:30:55
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 1000000
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int prime[M+1];
ll almostprime[M];
int main() {
ios_base::sync_with_stdio(0);
Set(prime,0);
prime[0]=1,prime[1]=1;
int m=sqrt(M);
for(int i=2;i<=m;i++){
if(!prime[i]){
for(int j=i*i;j<=M;j+=i)prime[j]=1;
}
}
// if(!prime[i])printf("%d",i);
// Pln();
int k=0;
for(ll i=2;i<=M;i++){
if(!prime[i]){
for(ll j=i*i;j<=1000000000000;j*=i)
almostprime[k++]=j;
}
}
// printf("%d",k);
int n;
scanf("%d",&n);
while(n--){
ll h,l,cnt=0;
scanf("%lld%lld",&l,&h);
for(ll i=0;i<k;i++){
// printf("%lld",almostprime[i]);
if(almostprime[i]>=l&&almostprime[i]<=h)cnt++;
}
printf("%lld\n",cnt);
}

}

[/sourcecode]