poj 3292 Semi-prime H-numbers （打表 同余模运算）

#include <iostream>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <stack>
#include <vector>
#include <map>

using namespace std;

#define N 1000020
#define INF 0xfffffff
#define PI acos (-1.0)
#define EPS 1e-8
#define met(a, b) memset (a, b, sizeof (a))

typedef long long LL;

int Hprim
;

void Init ()
{
for (int i=5; i<N; i+=4)
{
for (int j=5; j<N; j+=4)
{
if (i*j>=N) break;

if (!Hprim[i] && !Hprim[j] && i*j%4==1)
Hprim[i*j] = 1;///<span style="font-family: KaiTi_GB2312;font-size:18px; line-height: 26px;">H-semi-prime</span>
else Hprim[i*j] = -1;
}
}

int cnt = 0;
for (int i=5; i<N; i++)
{
if (Hprim[i]==1) cnt++;
Hprim[i] = cnt;
}
}

int main ()
{
int n;
Init();
while (scanf ("%d", &n), n)
{
printf ("%d %d\n", n, Hprim
);
}
return 0;
}