hd 2161 Primes
来源:互联网 发布:java getclassloader 编辑:程序博客网 时间:2024/05/22 00:43
Primes
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6867 Accepted Submission(s): 2782
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
12345170
Sample Output
1: no2: no3: yes4: no5: yes6: yes
Source
2008 “Sunline Cup” National Invitational Contest - Warm Up
Recommend
lcy | We have carefully selected several similar problems for you: 2162 2138 1695 1262 1693
#include<stdio.h>
int a[16010];
int fun()
{
int i,j;
a[1]=1;
for(i=2;i*i<16010;i++)
{
if(!a[i])
for(j=2*i;j<16010;j+=i)
a[j]=1;
}
}
int main()
{
int n,t=0;
fun();
while(scanf("%d",&n)!=EOF&&n>0)
{
if(a[n]==1||n==2)
printf("%d: no\n",++t);
else
printf("%d: yes\n",++t);
}
return 0;
}
0 0
- hd 2161 Primes
- Primes 2161
- HDU 2161 Primes 数论
- hdu 2161 Primes
- hdu-2161-Primes
- hdu 2161 Primes
- Primes hdoj 2161
- Primes HDU 2161
- hdu 2161 Primes
- hdu 2161 Primes
- [HDU 2161] Primes
- HDOJ 2161 Primes【素数】
- hdu 2161 Primes
- hdu 2161 Primes(素数)
- hdoj-2161-Primes
- HDOJ 2161 Primes
- HDU 2161 Primes
- HDOJ 2161 Primes(水题)
- Socket和Websocket区别
- BST
- 大数相减模板
- light oj1234
- Looper,Handler,Message
- hd 2161 Primes
- 重在于平时的努力,而不是临时抱佛脚
- Android 屏幕适配01
- 常用的nginx 配置
- 树的重心学习小记 Poj 1655 Balancing Act
- vc判断操作系统类型
- 大数相减(A -B)(A>B)
- REST架构与SOAP WebService的比较
- 页面的最小宽度