题目来源:http://acm.nyist.net/JudgeOnline/problem.php?pid=22
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int MAXN = 1010;
int IsPrime[MAXN];
void Check_Prime()
{
int i, j;
for(i = 2; i < MAXN; ++i)
IsPrime[i] = 1;
IsPrime[0] = IsPrime[1] = 0;
for(i = 2; i < MAXN; ++i)
{
if(IsPrime[i])
{
IsPrime[i] = i;
for(j = i+i; j < MAXN; j += i)
IsPrime[j] = 0;
}
}
}
int main()
{
int T, n, i, a, sum;
Check_Prime();
scanf("%d", &T);
while(T--)
{
scanf("%d", &n);
sum = 0;
for(i = 0; i < n; ++i)
{
scanf("%d", &a);
sum += IsPrime[a];
}
printf("%d\n", sum);
}
return 0;
}