Submission #4075081


Source Code Expand

from itertools import accumulate

N = 100000
prime = [True]*(N+1)

prime[0] = prime[1] = False

for i in range(N+1):
    if prime[i]:
        for j in range(2*i, N+1, i):
            prime[j] = False

prime2 = [0] * (N+1)

for i in range(N+1):
    if prime[i] and prime[(i+1)//2]:
        prime2[i] = 1

acc = list(accumulate(prime2))

Q = int(input())
for _ in range(Q):
    l, r = map(int, input().split())
    print(acc[r]-acc[l-1])

Submission Info

Submission Time
Task D - 2017-like Number
User youth
Language Python (3.4.3)
Score 400
Code Size 460 Byte
Status AC
Exec Time 874 ms
Memory 8100 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 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 AC 863 ms 7972 KB
02.txt AC 848 ms 7972 KB
03.txt AC 863 ms 7972 KB
04.txt AC 874 ms 7972 KB
05.txt AC 829 ms 8100 KB
06.txt AC 851 ms 8100 KB
07.txt AC 862 ms 7972 KB
sample_01.txt AC 62 ms 7716 KB
sample_02.txt AC 64 ms 7716 KB
sample_03.txt AC 64 ms 7716 KB