How many prime numbersCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Description
Give you a lot of positive integers, just to find out how many prime numbers there are.
Input
There are a lot of cases. In each case, there is an integer N representing the number of integers to find. Each integer won’t exceed 32-bit signed integer, and each of them won’t be less than 2.
Output
For each case, print the number of prime numbers you have found out.
Sample Input
3 2 3 4
Sample Output
2
求素数的个数,纯暴力解决
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
int main()
{
int n,m,i;
int flag=0;
int count=0;
while(~scanf("%d",&n))
{
count=0;
while(n--)
{
scanf("%d",&m);
flag=0;
for(i=2;i<=sqrt(m);i++)
if(m%i==0)
{
flag=1;
break;
}
if(flag==0)
count++;
}
printf("%d\n",count);
}
return 0;
}