HDU2161 Primes【筛选法+打表】
来源:互联网 发布:网络情缘一线牵表情包 编辑:程序博客网 时间:2024/06/08 08:53
Primes
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12512 Accepted Submission(s): 5178
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
问题链接:HDU2161 Primes。
题意简述:参见上文。
问题分析:用Eratosthenes筛选法设置一个素数判定数组,然后根据输入的正整数判定输出即可。
参考链接:(略)
AC的C++语言程序如下:
/* HDU2161 Primes */#include <iostream>#include <string.h>#include <math.h>using namespace std;const int N = 16000;bool prime[N+1];// 筛选法void sieveofe(int n){ memset(prime, true, sizeof(prime)); prime[0] = prime[1] = false; for(int i=2; i<=sqrt(n); i++) { if(prime[i]) { for(int j=i*i; j<=n; j+=i) //筛选 prime[j] = false; } } prime[2] = false; // 坑:这是特殊的地方}int main(){ sieveofe(N); int n, caseno=0; while(cin >> n && n > 0) { // 坑:结束条件是n<=0,不是n=0 cout << ++caseno << ": " << (prime[n] ? "yes" : "no") << endl; } return 0;}
阅读全文
0 0
- HDU2161 Primes【筛选法+打表】
- hdu2161 Primes
- HDU2161 Primes
- hdu2161 Primes
- 筛选法打素数表
- 筛选法素数打表
- Distinct Primes 打表
- 筛选法求素数 打表
- HDUOJ1215(筛选、打表)
- HDU5104 Primes Problem(素数筛选法)
- Count Primes 筛选法求素数
- HDU 4715 Difference Between Primes (打表)
- HDU 2161 Primes(素数打表)
- spoj 10232 Distinct Primes(打表)
- hdu 2161 Primes 素数打表
- hdoj--5104--Primes Problem(素数打表)
- 4715 Difference Between Primes 打表
- HDOJ(HDU) 2161 Primes(素数打表)
- jdk1.5、1.6、1.7新特性详细介绍(整理)
- [BZOJ2741][FOTILE模拟]L(分块+可持久化Trie)
- 使用TensorFlow基于阿里云AI实现图像识别技术(HR)
- Java PHP 开发常用软件以及前端开发ps dw软件Office2007百度网盘打包下载
- 【正一专栏】希望才是深深让人绝望的东西-论国足
- HDU2161 Primes【筛选法+打表】
- Java 8新特性终极指南
- C strtok C中字符串分割
- ExecuteNonQuery不能查询某个表中是否有数据
- jdk7和8的一些新特性介绍
- android 获取网络图片并在Imageview上显示
- ACM Dance Recital 题解
- 【ARM-Linux开发】【CUDA开发】【视频开发】关于Linux下利用GPU对视频进行硬件加速转码的方案
- 排序算法总结