UVa 10539 - Almost Prime Numbers

求low~high之间有多少个质数分解后由一个素数组成，将10^6内的素数全部打出来，然后枚举每个素数的n（n > 2 ）次幂在low和high之间个数的和。

/*************************************************************************
    > File Name: 10539.cpp
    > Author: Toy
    > Mail: ycsgldy@163.com
    > Created Time: 2013年06月09日 星期日 20时27分49秒
 ************************************************************************/

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>

using namespace std;
const int INF = 0x7fffffff;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned int u32;
typedef pair<i64,i64> II;
typedef vector<i64> IV;
typedef vector<II> IIV;
typedef vector<bool> BV;
#define For(t,v,c) for(t::const_iterator v=c.begin(); v!=c.end(); ++v)
#define IsComp(n) (_c[n>>6]&(1<<((n>>1)&31)))
#define SetComp(n) _c[n>>6]|=(1<<((n>>1)&31))
const int MAXP = 1000000;
const int SQRP = 1000; //sqrt(MAX)
int _c[(MAXP>>6)+1];
IV primes;
int Case;
i64 low, high;

void prime_sieve() {
	for ( int i = 3; i <= SQRP; i += 2 )
		if ( !IsComp(i) ) for ( int j = i*i; j <= MAXP; j+=i+i ) SetComp(j);
	primes.push_back ( 2 );
	for ( int i = 3; i <= MAXP; i += 2 ) if ( !IsComp(i) ) primes.push_back ( i );
}

int main ( ) {
	prime_sieve();
	scanf ( "%d", &Case );
	while ( Case-- ) {
        i64 ans = 0;
        scanf ( "%lld%lld", &low, &high );
        For ( IV, it, primes ) {
            i64 tmp = *it;
            tmp *= *it;
            while ( tmp < low ) tmp *= *it;
            while ( tmp >= low && tmp <= high ) {
                ans++;
                tmp *= *it;
            }
            if ( *it > high ) break;
        }
        printf ( "%lld\n", ans );
	}
    return 0;
}