hdu 2138 How many prime numbers
2014-03-09 18:49
477 查看
#include<stdio.h> #include<iostream> #include<math.h> using namespace std; int prime(int m){ int i, t = sqrt(m); if(m < 2){ return false; } if(m == 2 || m == 3){ return true; } for(i=2; i<=t; i++){ if((m % i) == 0){ return 0; } } return 1; } int main(){ int t, x, i, cnt; while(cin >> t){ cnt = 0; for(i=0; i<t; i++){ cin >> x; if(prime(x)){ cnt ++; } } cout << cnt << endl; } return 0; }
/*
错了N次
#include<stdio.h> #include<iostream> #include<math.h> using namespace std; int prime(int m){ int i; /* if(m < 2){ return false; } if(m == 2 || m == 3){ return true; } */ for(i=2; i<=sqrt(m); i++){ if((m % i) == 0){ return 0; }else{ return 1; } } } int main(){ int t, x, i, cnt; while(cin >> t){ cnt = 0; for(i=0; i<t; i++){ cin >> x; if(prime(x)){ cnt ++; } } cout << cnt << endl; } return 0; }
*/
相关文章推荐
- HDOJ(HDU) 2138 How many prime numbers(素数-快速筛选没用上、)
- 【HDU】2138 How many prime numbers
- HDU 2138:How many prime numbers 【水】
- HDU 2138 How many prime numbers(米勒拉宾素数测试算法)
- HDOJ(HDU) 2138 How many prime numbers(素数-快速筛选没用上、)
- HDU 2138 How many prime numbers
- HDU 2138 How many prime numbers
- HDU 2138 How many prime numbers
- HDU 2138 How many prime numbers (判素数,米勒拉宾算法)
- HDU 2138 How many prime numbers
- HDU 2138 How many prime numbers
- HDU_2138_How many prime numbers
- HDU 题目2138 How many prime numbers
- HDU 2138 How many prime numbers(参考博客)
- HDu 2138 How many prime numbers 高效Miller素数测试
- hdu 2138 How many prime numbers
- hdu 2138 How many prime numbers
- hdu 2138 How many prime numbers (Miller Rabbin大质数判定)
- hdu 2138 How many prime numbers(数论:素数判定)
- HDU 2138 How many prime numbers