《ACM程序设计》书中题目R

Description
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.

Input
There are several test cases in the input. Each case contains a single integer N (2 <= N <= 1,000,000)

Output
One line with a single integer for each case. If the number is a semi-prime number, then output “Yes”, otherwise “No”.

Sample Input
3
4
6
12

Sample Output
No
Yes
Yes
No

求半素数，用打表存一下输出，不然容易超时。

#include<bits/stdc++.h>
using namespace std;
vector<int> v;
set<int> s;
void ChoosePrime(int a,int b)
{
    for(int i=a;i<=b;i++)
    {
        if(i!=2&&i%2==0) 
            continue;
        for(int j=3;j*j<=i;j+=2)
        {
            if(i%j==0) goto RL;
        }
        v.push_back(i);
    RL:continue;
    }
}
int main()
{
    ChoosePrime(2,500000);
    int i,j,p;
    for(i=0;i<v.size();i++)
    {
        for(j=0;j<v.size();j++)
        {
            p=v[i]*v[j];
            if(p<1000000) 
                s.insert(p);
            else 
                break;
        }
    }
    int n;
    set<int>::iterator it;
    while(cin>>n)
    {
        it=s.find(n);
        if(it!=s.end()) 
            cout<<"Yes"<<endl;
        else 
            cout<<"No"<<endl;
    }
    return 0;
}