POJ3292——Semi-prime H-numbers

Semi-prime H-numbers Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8869   Accepted: 3912 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 Source Waterloo Local Contest, 2006.9.30

题目大意：

H-number就是模4余1的数，即 4n+1；

H-primes就是H-number中的素数；

H-semi-primes是因子只有两个H-primes；

H-composite就是H-number剩下的数；

求从 1 到 n H-semi-primes的个数；

思路：

直接打表。。。。

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1000010;
int H_number[N+1];

void dell()
{
    memset(H_number,0,sizeof(H_number));       //初始值为0，表示 i 为 H-primes
    for( int i = 5;i <= N;i+=4 )               //只遍历 4n+1
    {
        for( int j = 5;j <= N;j+=4 )
        {
            int x = i*j;
            if( x>N )
                break;
            if( !H_number[i] && !H_number[j] )              // H-number[i] 和 H-number[j] 都是0,表示  i*j 为H-semi-primes
                H_number[x] = 1;
            else                                                                 //否则  <span style="font-family: Arial, Helvetica, sans-serif;">i*j 为H-composite</span>
                H_number[x] = -1;
        }

    }
    int cnt = 0;
    for( int i = 1;i <= N;i++ )
    {
        if( H_number[i]==1 )
            cnt++;
        H_number[i] = cnt;               //此时H-number[i] 表示从 1 到 i <span style="font-family: Arial, Helvetica, sans-serif;">H-semi-primes的个数</span>

    }
}


int main()
{
    dell();

    int n;
    while( cin>>n&&n )
    {
        cout<<n<<" "<<H_number[n]<<endl;
    }

    return 0;
}