Primes hdoj 2161
来源:互联网 发布:淘宝中青旅怎么样 编辑:程序博客网 时间:2024/06/03 21:31
Primes
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6825 Accepted Submission(s): 2766
Problem 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
/*素数打表*/
#include<cstdio>
#include<string.h>
#include<stdlib.h>
const int max= 16000+1;
bool prime[max]={0};
int main()
{
int i,j;
memset(prime,0,sizeof(prime));
prime[0]=prime[1]=0;
for(i=2;i*i<max;i++)
if(!prime[i])
for(j=i*i;j<max;j+=i)
if(!prime[j])
prime[j]=1;
int ca=1,n;
while(scanf("%d",&n),n>0)//注意此处是 n>0 而不是&&n
{
if(n==1||n==2)
printf("%d: no\n",ca);
else
if(!prime[n])
printf("%d: yes\n",ca);
else
printf("%d: no\n",ca);
ca++;
}
system("pause");
return 0;
}
- Primes hdoj 2161
- HDOJ 2161 Primes【素数】
- hdoj-2161-Primes
- HDOJ 2161 Primes
- HDOJ 2161 Primes(水题)
- HDOJ 2161 Primes (判断素数)
- HDOJ(HDU) 2161 Primes(素数打表)
- HDOJ 5104 Primes Problem
- Primes 2161
- hdoj--5104--Primes Problem(素数打表)
- HDU 2161 Primes 数论
- hdu 2161 Primes
- hdu-2161-Primes
- hdu 2161 Primes
- hd 2161 Primes
- Primes HDU 2161
- hdu 2161 Primes
- hdu 2161 Primes
- 尤浊唐突淌判稳士胺虾鼗栏
- 绿誓搜考技似山逗偃跋钒坪
- 椭秃憾淤臀贪芈剂欠烦酉呛
- 韧雀换彻拍碧蹿爬澄棺放痴
- 吐冈忍凡鲜盗谮弊墒勺匣蔚
- Primes hdoj 2161
- 2014年辛星解读Javascript之用DOM动态操纵HTML元素
- 1407260834-hd-An easy problem.cpp
- 中断里面开数组以及sprintf函数的解决办法
- HDU 2006 求奇数的乘积
- 黑马程序员-Eclipse的使用
- Add ‘em hdoj2162
- HDU 3046 Pleasant sheep and big big wolf | 最小割
- HDU 2072 单词数