Semi-prime H-numbers UVA - 11105

打表法的应用，首先找出范围内所有的H数，然后对于输入的h，依次求出半H数，如果在范围内就计数加一，否则就直接结束，同时注意溢出问题以及每个半H数仅仅只能计数一次，具体实现见如下代码：

#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;

const int maxn = 1000005;
vector<int> Hprime;
bool visit[maxn];
const int up = 1000001;
int amount;

void Init(){
	memset(visit, 0, sizeof(visit));
	for (int i = 5; i <= up; i+=4){
		if (!visit[i]){
			Hprime.push_back(i);
			for (int j = 2 * i; j <= up; j += i){
				visit[j] = 1;
			}
		}
	}
}

void Deal(int n){
	for (int i = 0; i < Hprime.size(); i++){
		long long temp = Hprime[i] * Hprime[i];
		if (temp > n) break;
		for (int j = i; j < Hprime.size(); j++){
			temp = Hprime[i] * Hprime[j];
			if (temp > n) break;
			if (visit[temp]) continue;
			amount++;
			visit[temp] = true;
		}
	}
	cout << n << " " << amount << endl;
}

int main(){
	Init();
	int n;
	while (cin >> n){
		if (n == 0) break;
		memset(visit, 0, sizeof(visit));
		amount = 0;
		Deal(n);
	}
	return 0;
}