hdoj-2161-Primes
来源:互联网 发布:可可网络验证后台 xss 编辑:程序博客网 时间:2024/06/06 15:51
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<cstring>#include<iostream>using namespace std;int vis[20000];void sieve(){ memset(vis,0,sizeof(vis)); for(int i=2;i<=20000;i++) { if(!vis[i]) for(int j=i*i;j<=20000;j+=i) { vis[j]=1; }}}int main(){ int n,Case; Case=0; while(scanf("%d",&n)!=EOF) { if(n<=0) break; Case++; sieve(); if(n==1) printf("%d: no\n",Case); else if(n==2) printf("%d: no\n",Case); else { if(vis[n]==1) printf("%d: no\n",Case); else printf("%d: yes\n",Case); } } 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
- 意念力言语--意念力应用篇之二
- hdu oj 1201:18岁生日 解题报告
- Linux截屏工具——scrot
- java 实现接受一个有字母和数字以及空格组成的字符串,和一个字符,然后输出输入字符串中含有该字符的个数。不区分大小写
- 学习BroadcastReceiver
- hdoj-2161-Primes
- 程序猿的转型
- python property函数
- LintCode(99) 重排链表
- spring_AOP前置通知&后置通知&返回通知&环绕通知
- Java之业务异常类BusinessException封装实例
- 多线程(一)
- SQLite和listview
- java实现 计算字符串最后一个单词的长度,单词以空格隔开。