Submission #5443757


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)))
print(p[:N])

Submission Info

Submission Time
Task D - Five, Five Everywhere
User Haruyuk1
Language PyPy3 (2.4.0)
Score 0
Code Size 475 Byte
Status WA
Exec Time 189 ms
Memory 40176 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
WA × 3
WA × 5
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 189 ms 40176 KB
in02.txt WA 179 ms 39408 KB
sample_01.txt WA 178 ms 39408 KB
sample_02.txt WA 173 ms 39408 KB
sample_03.txt WA 177 ms 39408 KB