//判断素数没有用遍历法是因为上一道素数的题老是判我TLE,就保留了
AC代码:
#include<cmath>
#include<iostream>
#include<iomanip>
#include <stdio.h>
#include <stdlib.h>
int isprime(int x)
{
if (x == 1)
{
return(0);
}
else if (x == 2)
{
return(1);
}
else if (x % 2 == 0)
{
return(0);
}
else
{
for (int i = 3; i <= sqrt(x); i += 2)
{
if (x%i == 0) return(0);
}
return(1);
}
};
int count(int num)
{
int cnt = 0;
for (int i = 2; i <= num / 2; i++)
{
if (isprime(i) == 1 && isprime(num - i) == 1&&i!=num-i)
{
cnt++;
}
}
return(cnt);
};
using namespace std;
int main()
{
int t;
cin >> t;
int a;
while (cin >> a, t--)
{
cout << count(a) << endl;
}
//system("pause");
return 0;
}