Submission #6439618

---

Source Code Expand

from itertools import combinations
from fractions import gcd
import math


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

Submission Info

Judge Result