Submission #6111244

---

Source Code Expand

def shave(n):
    n_root = int(n**0.5)
    candidate = [i for i in range(3,n+1,2)]
    for i in range(3,n_root+2,2):
        candidate = [ j for j in candidate if j == i or j % i != 0]   
    candidate = [2] + candidate
    return candidate

prime_list = (shave(55555))
prime_list = [ i for i in prime_list if i % 5 == 1]
n = int(input())


print(*prime_list[:n])

Submission Info

Judge Result