HDU - 2161 - Primes (质数)
来源:互联网 发布:上证综合指数数据 编辑:程序博客网 时间:2024/06/05 08:22
Primes
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8959 Accepted Submission(s): 3754
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
AC代码:
#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#include <cstdio>#include <cctype>#include <string>#include <vector>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>#define LL long long#define INF 0x7fffffffusing namespace std;const int maxn = 20000;int prime[20000];void init() {prime[1] = 2;for(int i = 2; i < maxn; i ++) if(prime[i] == 0) {prime[i] = 1;for(int j = i * 2; j < maxn; j += i) {prime[j] = 2;}}prime[2] = 2;}int main() {init();int cas = 1;int a;while(scanf("%d", &a) != EOF) {if(a == 0) break;if(prime[a] == 1) {printf("%d: yes\n", cas ++);}else if(prime[a] == 2) {printf("%d: no\n", cas ++);}}return 0;}
0 0
- HDU - 2161 - Primes (质数)
- (LeetCode)Count Primes --- 统计素数(质数)
- Count Primes (质数的个数)
- HDU 2161 Primes(素数打表)
- 【HDU 2161】Primes(素数~水)
- 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 Primes
- hdu 2161 Primes(素数)
- HDU 2161 Primes
- LeetCode 204 Count Primes(质数计数)(*)
- <LeetCode><Easy> 204 Count Primes --找素数/质数 (?)
- 5年后你想过什么样的生活?
- file explorer查看手机SD卡data目录
- AndroidViewAnimations开源框架实现
- 数据库日记文件的查看与修改
- Lakes Environmental ARTM View v1.4.2 1CD放射物扩散模拟模型
- HDU - 2161 - Primes (质数)
- 解决子级用css float浮动 而父级div没高度不能自适应高度 - DIVCSS
- Tomcat 简介
- poj 2096 概率dp
- Lakes.AERMOD.View.v8.9.0 1CD大气扩散模型软件包
- Fisher线性判别函数+c代码
- CallableStatement用法
- python 模块
- poj 2251 Dungeon Master(三维BFS)(中等)