[Offer收割]编程练习赛12 register

Ended

Participants:1323

Verdict:Accepted
Score:100 / 100
Submitted:2017-04-02 13:09:34

Lang:Python2

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
N = input()
n = N+1
isPrime = [True]*n
isPrime[0] = False
isPrime[1] = False
i = 2
while i*i<n:
    if not isPrime[i]:
        i+=1
        continue
    for j in xrange(i*i,n,i):
        isPrime[j] = False
    i+=1
prime = [i for i in xrange(len(isPrime)) if isPrime[i] == True]
table = set(prime)
for i in prime:
    if N-i in table:
        print i,
        print N-i
        break
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX