Submission #6439345

Source Code Expand

n = int(input())
mx = 55555
primes = [2]
for i in range(3, mx, 2):
    if all(i % p != 0 for p in primes):
        primes.append(i)
        if len(primes) == n + 1:
            break
if n % 2 == 0:
    print(*primes[1:])
else:
    print(*primes[:-1])

Submission Info

Submission Time
Task D - Five, Five Everywhere
User itopost
Language Python (3.4.3)
Score 0
Code Size 261 Byte
Status WA
Exec Time 17 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 1
WA × 2
AC × 1
WA × 4
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All in01.txt, in02.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
in01.txt WA 17 ms 3060 KB
in02.txt WA 17 ms 2940 KB
sample_01.txt AC 17 ms 2940 KB
sample_02.txt WA 17 ms 2940 KB
sample_03.txt WA 17 ms 2940 KB