U - Primes HDU - 2161

U - Primes

  HDU - 2161

Description

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.

Input

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

Output

The 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

题意：询问是不是素数。

题解：简单题，注意2默认为非素数和输入结束判断为负数和0.

AC代码：

/*
* @Author: 王文宇
* @Date:   2017-10-28 14:47:20
* @Last Modified by:   王文宇
* @Last Modified time: 2017-10-28 15:08:04
*/
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 17000;
int a[maxn];
int b[maxn];
int main(int argc, char const *argv[])
{
	memset(a,0,sizeof(a));
	int k =0;
	a[0]=a[1]=1;
	for(int i=2;i<=maxn;i++)
	{
		if(a[i]==0)
		{
			for(int j=i*2;j<=maxn;j+=i)a[j]=1;
		}
	}
	a[2]=1;
	int x;
	int t=1;
	while(scanf("%d",&x))
	{
		if(x<=0)break;
		if(a[x])printf("%d: no\n",t);
		else printf("%d: yes\n", t);
		t++;
	}
	return 0;
}