2025-11-13 23:42:24 +09:00

22 lines
522 B
Python

import sys
input = sys.stdin.readline
nums = [int(input()) for _ in range(int(input()))]
num_max = max(nums)
isPrime = [True for _ in range(num_max+1)]
isPrime[0], isPrime[1] = False, False
for i in range(2,int(num_max**0.5)+1) :
if isPrime[i] :
for j in range(i*i, num_max+1, i) :
isPrime[j] = False
result = []
for n in nums :
count = 0
for i in range(2,n//2 + 1) :
if isPrime[n-i] and isPrime[i] :
count += 1
result.append(str(count))
print('\n'.join(result))