POJ 3292 Semi-prime H-numbers

http://poj.org/problem?id=3292

题目大意：

H-numbers      只能被1和它本身整除     并且%4==1

H-semi-primes    由两个H-numbers 相乘得到

给一个  H-numbers  求在它之前有多少个   H-semi-primes

分析：

筛选法

AC代码：

#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include<list>
#include <bitset>
#include <climits>
#include <algorithm>
#define gcd(a,b) __gcd(a,b)
#define mset(a,n) memset(a,n,sizeof(a))
#define FIN	freopen("input.txt","r",stdin)
#define FOUT 	freopen("output.txt","w",stdout)
typedef long long LL;
const LL mod=1e9+7;
const int INF=0x3f3f3f3f;
const double PI=acos(-1.0);
using namespace std;
int a[1000005];
void solve (){
    memset(a,0,sizeof(a));
    a[1]=0;
    for (LL i=5;i<=1000001;i+=4){
        if(a[i]==0)
        for (LL j=i;j<=1000001;j+=4){
            if(i*j>1000001) break;//      用LL 不然乘会爆
            if(!a[i]&&!a[j])  a[i*j]=1;
            else a[i*j]=-1;
        }
    }
    for (int i=1;i<=1000001;i++){
        if(a[i]==-1) a[i]=0;
        a[i]+=a[i-1];
    }
}
int main (){
    int n;
    solve();
    while (scanf ("%d",&n)&&n){
        printf ("%d %d\n",n,a[n]);
    }
    return 0;
}