Prime Number Definition
An integer greater than one is called a prime number if its only positive divisors (factors) are one and itself. For instance, 2, 11, 67, 89 are prime numbers but 8, 20, 27 are not.
Semi-Prime Number Definition
An integer greater than one is called a semi-prime number if it can be decompounded to TWO prime numbers. For example, 6 is a semi-prime number but 12 is not.
Your task is just to determinate whether a given number is a semi-prime number.
素数定义
如果一个大于1的整数只有一个正整数(因子)是一个整数,那么它就称为素数。 例如,2,11,67,89是素数,但8,20,27不是。
半素数定义
如果一个大于1的整数可以分解为两个素数,则称其为一个半素数。 例如,6是一个半素数,但12不是。
你的任务只是确定一个给定的数字是否是一个半素数。
InputThere are several test cases in the input. Each case contains a single integer N (2 <= N <= 1,000,000)
输入中有几个测试用例。 每个案例包含一个整数N(2 <= N <= 1,000,000)
OutputOne line with a single integer for each case. If the number is a semi-prime number, then output "Yes", otherwise "No".
一行每个案件都有一个整数。 如果数字是半素数,则输出“是”,否则输出“否”。
Sample Input3
4
6
12
Yes
Yes
No
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int m=1000005;
bool prime[m];
//素数筛子 哈哈今天学到了素数筛子
void sieveofe(int n)//素数筛子将N以内全部的素数标记为true
{
memset(prime,true,sizeof(prime));//错误2将第二个PRIME掉了
prime[0]=prime[1]=0;
for(int i=2;i<=sqrt(n);i++)
{
if(prime[i])
for(int j=i*i;j<=n;j+=i)
{
prime[j]=false;
}
}
}
int main()
{
sieveofe(m);
int N,i,c,sum;
while(scanf("%d",&N)!=EOF)
{
sum=0;
for(int k=2;k<=sqrt(N);k++)
{
if(prime[k])//错误一将K写成I;输出例题全是NO
{
c=N/k;
if(prime[c]&&c*k==N)
{
sum=1;
break;
}
}
}
cout<<(sum==1?"Yes":"No")<<endl;
}
return 0;
}