hdu acm steps 2.1.2
2011-10-09 20:10
435 查看
求素数。。直接暴力了;
下面是AC代码:
下面是AC代码:
include<iostream> #include<cmath> #define N 100000000 using namespace std; int main() { int n,b,count,flag,i; while(scanf("%d",&n)!=EOF) { count = 0; while(n--) { scanf("%d",&b); flag = 0; for(i=2;i<=sqrt(b);i++) if(b%i==0) { flag = 1; break; } if(!flag) count ++; } printf("%d\n",count); } return 0; }
相关文章推荐
- hdu acmsteps 2.1.2 How many prime numbers
- HDU OJ ACM Steps 上的题目详细介绍
- hdu ACM Steps 做题笔记(Chapter One)
- hdu acmsteps 2.2
- ACM-steps-2.1.2--判别素数
- HDU ACM Steps 1.2.1 hide handkerchief
- hdu 1071 ACM steps The area
- hdu-acm steps Monkey and Banana
- hdu acm steps 1.3.1
- hdu acmsteps 2.1.3 Cake
- hdu acmsteps 2.1
- hdu acmsteps 2-1-3相遇周期
- hdu acm steps 1.3.2
- hdu acmsteps 2.1.3 cake
- hdu acm steps 1.3.3
- hdu ACM steps 1.2.8 hdu1219
- hdu acmsteps 1.3.1
- HDU ACM Steps 攻略
- hdu acm steps 1.3.4
- hdu ACM STEPS 1.2.7