Almost Prime Numbers UVA - 10539

思路比较简单的一道题目，结合打表法求解出范围内的所有的素数，然后关键在于素数的n次幂（n>=2）是满足题目当中的条件的，直接编程实现即可，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

typedef long long LL;
const LL maxn = 1000000;
const LL maxn2 = 1000000000000;
bool vis[maxn+5];
vector<LL> NoPrime;
vector<LL> Prime;

void Init(){
	memset(vis, 0, sizeof(vis));
	vis[0] = vis[1] = 1;
	LL up = floor(sqrt(maxn) + 0.5);
	for (LL i = 2; i <= up; i++){
		if (!vis[i]){
			for (LL j = i*i; j <= maxn; j += i){
				vis[j] = 1;
			}
		}
	}
	for (LL i = 2; i <= maxn; i++){
		if (!vis[i]) Prime.push_back(i);
	}
	for (LL i = 0; i < Prime.size(); i++){
		LL data = Prime[i] * Prime[i];
		while (data <= maxn2){
			NoPrime.push_back(data);
			data *= Prime[i];
		}
	}
}

int main(){
	Init();
	sort(NoPrime.begin(),NoPrime.end());
	LL L, U;
	int N;
	cin >> N;
	while (N--){
		cin >> L >> U;
		LL a = upper_bound(NoPrime.begin(), NoPrime.end(), U) - NoPrime.begin();
		LL b = lower_bound(NoPrime.begin(), NoPrime.end(), L) - NoPrime.begin();
		cout << a - b << endl;
	}
	return 0;
}