Submission #5443769

---

Source Code Expand

def primes(n):
    ass = []
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    for i in range(len(is_prime)):
        if is_prime[i]:
            ass.append(i)
    return ass
    
N = int(input())
p = list(filter(lambda x:x%10 == 1, primes(55555)))
for i in range(N):
    print(p[i], end=" ")

Submission Info

Judge Result