case通过率为25.00%
思路:1.先找出所给数字之内的所有素数,存在num里
2.对num进行遍历
import sys
line_1 = input().split()
n=line_1[0]
n=int(n)
num=[1]
re=0
for i in range(2,n):
for j in range(2,i):
if i%j==0:
break
num.append(i)
for i in range(len(num)):
for j in range(i,len(num)):
if num[i]+num[j]==n:
re=re+1
print(re)
line_1 = input().split()
n=line_1[0]
n=int(n)
num=[1]
re=0
for i in range(2,n):
for j in range(2,i):
if i%j==0:
break
num.append(i)
for i in range(len(num)):
for j in range(i,len(num)):
if num[i]+num[j]==n:
re=re+1
print(re)
更新:原来1不是质数。。。改了下全部通过
import sys
line_1 = input().split()
n=line_1[0]
n=int(n)
num=[i for i in range(2,n+1)]
re=0
for i in range(3,n):
for j in range(2,i):
if i%j==0:
num.remove(i)
break
for i in range(len(num)):
for j in range(i,len(num)):
if num[i]+num[j]==n:
re=re+1
print(re)
line_1 = input().split()
n=line_1[0]
n=int(n)
num=[i for i in range(2,n+1)]
re=0
for i in range(3,n):
for j in range(2,i):
if i%j==0:
num.remove(i)
break
for i in range(len(num)):
for j in range(i,len(num)):
if num[i]+num[j]==n:
re=re+1
print(re)