hdu 2161
来源:互联网 发布:hdmi数字矩阵切换器 编辑:程序博客网 时间:2024/04/30 19:46
Primes
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4352 Accepted Submission(s): 1782
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
//输入的n要大于0#include <stdio.h>#include <string.h>int a[16001];int main(){int i, j, n, acount = 1;memset(a, 1, sizeof(a));for (i = 2; i < 16001; i++)if(a[i])for(j = i; j*i < 16001; j++)a[j*i] = 0;a[1] = a[2] = 0;while (~scanf("%d", &n), n > 0){if(a[n])printf("%d: yes\n", acount++);elseprintf("%d: no\n", acount++);}return 0;}
- hdu 2161
- hdu 2161
- HDU 2161 Primes 数论
- hdu 2161 Primes
- hdu-2161-Primes
- hdu 2161 Primes
- Primes HDU 2161
- hdu 2161 Primes
- hdu 2161 Primes
- [HDU 2161] Primes
- HDU 2161 数学
- hdu 2161 Primes
- hdu 2161 Primes(素数)
- HDU 2161 Primes
- hdu
- hdu
- HDU
- hdu ()
- ThinkPHP模板中使用自定义函数的方法
- MINA试用
- 怀念浆洗被子的童年
- robots.txt语法大全
- 【JSP】jsp的运行原理
- hdu 2161
- VC 超链接
- python 安装 遇到 ImportError: No module named _struct
- Java取一年有多少周、某周的第一天和最后一天
- SAP PP 展开BOM(多层)程序代码
- 三层架构的学习
- vc下cstring转换为float
- winsock Select模型
- LEADTOOLS成像技术年终点评