Submission #4074996


Source Code Expand

import numpy as np
n = (int)(input())
s = []
t = []
for _ in range(n):
    a, b = (list)(map(int, input().split()))
    s.append(a)
    t.append(b)
mi = min(s)
ma = max(t)


def primeList(N):
    max = int(np.sqrt(N))
    seachList = [i for i in range(2, N+1)]
    primeNum = []
    while seachList[0] <= max:
        primeNum.append(seachList[0])
        tmp = seachList[0]
        seachList = [i for i in seachList if i % tmp != 0]
    primeNum.extend(seachList)
    return primeNum


def prime(s, t):
    primes = primeList(t)
    l = [0]*(t+1)
    c = 0
    s = 0
    for i in range(s, t+1):
        if i in primes and (i+1)//2 in primes:
            c += 1
        l[i] = c
    return l


primes = prime(mi, ma)
for i in range(n):
    print(primes[t[i]] - primes[s[i]-1])

Submission Info

Submission Time
Task D - 2017-like Number
User youth
Language PyPy3 (2.4.0)
Score 0
Code Size 816 Byte
Status RE
Exec Time 181 ms
Memory 38256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
RE × 3
RE × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt RE 172 ms 38256 KB
02.txt RE 170 ms 38256 KB
03.txt RE 170 ms 38256 KB
04.txt RE 170 ms 38256 KB
05.txt RE 170 ms 38256 KB
06.txt RE 181 ms 38256 KB
07.txt RE 170 ms 38256 KB
sample_01.txt RE 170 ms 38256 KB
sample_02.txt RE 170 ms 38256 KB
sample_03.txt RE 169 ms 38256 KB