POJ 3292 Semi-prime H-numbers 素数筛法变种

Description
This problem is based on an exercise of David Hilbert, who pedagogically suggested that one study the theory of 4n+1 numbers. Here, we do only a bit of that.
An H-number is a positive number which is one more than a multiple of four: 1, 5, 9, 13, 17, 21,… are the H-numbers. For this problem we pretend that these are the only numbers. The H-numbers are closed under multiplication.
As with regular integers, we partition the H-numbers into units, H-primes, and H-composites. 1 is the only unit. An H-number h is H-prime if it is not the unit, and is the product of two H-numbers in only one way: 1 × h. The rest of the numbers are H-composite.
For examples, the first few H-composites are: 5 × 5 = 25, 5 × 9 = 45, 5 × 13 = 65, 9 × 9 = 81, 5 × 17 = 85.
Your task is to count the number of H-semi-primes. An H-semi-prime is an H-number which is the product of exactly two H-primes. The two H-primes may be equal or different. In the example above, all five numbers are H-semi-primes. 125 = 5 × 5 × 5 is not an H-semi-prime, because it’s the product of three H-primes.
Input
Each line of input contains an H-number ≤ 1,000,001. The last line of input contains 0 and this line should not be processed.
Output
For each inputted H-number h, print a line stating h and the number of H-semi-primes between 1 and h inclusive, separated by one space in the format shown in the sample.
Sample Input
21
85
789
0
Sample Output
21 0
85 5
789 62

题目大意：
H数是比4的倍数多1的正数，1, 5, 9, 13, 17, 21…都是H数。
H数分为以下三种：
1、H-primes：这种数除了1和它本身外，不能被其他的H-number整除，且1不是H-primes；
2、H-semi-primes是由两个H-primes相乘得出的，这两个H-primes可以相同，也可以不同。
3、剩下的是H-composite。

例如，前几个H-semi-primes是：5×5 = 25,5×9 = 45,5×13 = 65,9×9 = 81,5×17 = 85。
125 = 5 × 5 × 5 不是一个H-semi-prime, 因为它是3个H-primes的乘积。

给出一个数N，你的任务是计算1~N中H-semi-primes的个数。

解题思路：
1，模拟素数筛法筛选出题目所定义的H-primes
2，进行遍历打表，筛选出所有的定义的H-semi-prime
注意，H-semi-primes是由两个H-primes相乘得出的，但这种得出方法可以不唯一，例如441=21*21=9*49 也是一个H-semi-prime

AC代码：

#include<iostream>
#include<math.h>
#include<stdio.h>
using namespace std;
const int maxn = 1000005;
bool mark[maxn];
int prime[maxn];//保存H-prime
int ans[maxn];//保存H-semi-prime
int cnt = 0;
int ans_cnt = 0;
void init() {//留下来为true的都是H-prime
	for (int i = 1; i <= 1000001; i++) {//先选出所有的H-number
		mark[i] = false;
		if (i % 4 == 1) { mark[i] = true; }
	}
	mark[1] = false;//1不是H-prime；
	for (int i = 5; i <= 1000001; i += 4) {//留下来为true的都是H-prime
		if (!mark[i]) continue;
		prime[++cnt] = i;
		for (int j = i * 2; j <= 1000001; j += i) {
			mark[j] = false;
		}
	}
	for (int i = 1; i <= 1000001; i++) {
		if (i % 4 != 1) continue;
		int tmp = sqrt(i);
		int now = 0;
		for (int j = 1; prime[j] <= tmp; j++) {//判断i满不满足题意
			if (i%prime[j] == 0) {
				int b = i / prime[j];
				if (mark[b]) {
					now++;
				}
			}
		}
		if (now >= 1) { ans[++ans_cnt] = i; }
	}
}

int main() {
	int n;
	init();
	while (cin >> n) {
		if (n == 0)break;
		int answer = 0;
		for (int i = 1; i <= ans_cnt; i++) {
			if (ans[i] <= n)answer++;
			else break;
		}
		cout << n << " " << answer << endl;
	}
}

AC完之后，跑去讨论区逛了一遍，看到大神们留下的代码，我整个人都惊了(ΩДΩ)

#include<iostream>
#include<stdio.h>
using namespace std;
int h[1000010];
int main()
{
	for (int i = 1; i <= 1000002; i++)h[i] = 0;
	int i, j;
	for (i = 5; i<1000; i += 4)
	{
		if (h[i] == 0)
		{
			for (j = i; i*j<1000002; j += 4)
			{
				h[i*j] = h[i] + h[j] + 1;
			}
		}
	}//筛出来等于1的都是“半素数”，0或者其他不是1的不是

	for (i = 25; i<1000002; i++)
	{
		h[i] = (h[i] == 1) + h[i - 1];
	}//统计

	while (scanf("%d", &i) && i)
	{
		printf("%d %d\n", i, h[i]);
	}
	return 0;
}