ACM Primes

Write a program to read in a list of integers and determine whether or not each number is prime. A number, n, is prime if its only divisors are 1 and n. For this problem, the numbers 1 and 2 are not considered primes. 

InputEach input line contains a single integer. The list of integers is terminated with a number<= 0. You may assume that the input contains at most 250 numbers and each number is less than or equal to 16000. 
OutputThe output should consists of one line for every number, where each line first lists the problem number, followed by a colon and space, followed by "yes" or "no". 
Sample Input

1
2
3
4
5
17
0

Sample Output

1: no
2: no
3: yes
4: no
5: yes
6: yes

#include<bits/stdc++.h>
using namespace  std;
const int MAX = 16005;
int prime[MAX];
void init()
{
    memset(prime,0,sizeof(prime));
    prime[1] = 2; //非素数
    for(int i = 2; i < MAX; i++) /*先建立一个素数表*/
    {
        if(prime[i] == 0)
        {
            prime[i] = 1;
            for(int j = i *2; j < MAX; j+=i)
                prime[j] = 2;
        }
    }
    prime[2] = 2;
}
int main()
{
    init();
    int temp = 0,n;
    while(cin>>n)
    {
        if(n <= 0)
            break;
        if(prime[n] == 2)    //非素数
            cout<< ++temp <<": no"<<endl;
        else    //素数
            cout<< ++temp <<": yes"<<endl;
    }

    return 0;
}