hdu-2138-How many prime numbers
2013-11-21 12:24
253 查看
#include<stdio.h>
#include<math.h>
int sushu(int n)
{
int i,t=1;
for(i=2;i<=sqrt(n);i++)
if(n%i==0)
{
t=0;
break;
}
if(t==0)
return 0;
else
return 1;
}
int main()
{
int n,m,sum,i;
while(scanf("%d",&n)!=EOF)
{
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&m);
if(sushu(m))
sum++;
}
printf("%d\n",sum);
}
return 0;
}
#include<math.h>
int sushu(int n)
{
int i,t=1;
for(i=2;i<=sqrt(n);i++)
if(n%i==0)
{
t=0;
break;
}
if(t==0)
return 0;
else
return 1;
}
int main()
{
int n,m,sum,i;
while(scanf("%d",&n)!=EOF)
{
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&m);
if(sushu(m))
sum++;
}
printf("%d\n",sum);
}
return 0;
}
相关文章推荐
- 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-Rabin算法模板
- 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【素数判断,卡时间!!】
- 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(米勒拉宾素数测试算法)