POJ-3292-Semi-prime H-numbers

最新推荐文章于 2017-01-29 01:26:35 发布

Stone_____

最新推荐文章于 2017-01-29 01:26:35 发布

阅读量193

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/zcy_2016/article/details/52311219

版权

POJ 专栏收录该内容

82 篇文章 0 订阅

订阅专栏

Semi-prime H-numbers

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8736		Accepted: 3825

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

Sample Output

21 0
85 5
789 62

定义一种数叫H-numbers，它是所有能除以四余一的数。
在H-numbers中分三种数：
1、H-primes，这种数只能被1和它本身整除，不能被其他的H-number整除，例如9是一个H-number，能被1，3，9整除，但3不是H-number，所以他是H-primes。
2、H-semi-primes是由两个H-primes相乘得出的。
3、剩下的是H-composite。

给一个数，求1到这个数之间有多少个H-semi-primes。

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
using namespace std;
const int MAX = 1000001+10;
int vis[MAX], num[MAX], n;
void H_semi_primes()
{
    memset(num, 0, sizeof(num));
    memset(vis, 0, sizeof(vis));
    for(int i = 5; i<MAX; i+=4)
    {
        for(int j = 5; i*j<MAX;j+=4)
               {
                   if(!vis[i]&&!vis[j])vis[i*j] = 1;
                   else vis[i*j] = -1;
               }
    }
    for(int i = 1;i<MAX; ++i)
        if(vis[i]==1)num[i]=num[i-1]+1;
        else num[i] = num[i-1];
}
int main()
{
    H_semi_primes();
    while(~scanf("%d", &n)&&n)
            printf("%d %d\n",  n,num[n]);
    return 0;
}