Submission #4075080
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 | A - New Year |
User | youth |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 460 Byte |
Status | RE |
Exec Time | 64 ms |
Memory | 7716 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, sample_01.txt, sample_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | RE | 62 ms | 7716 KB |
02.txt | RE | 61 ms | 7716 KB |
03.txt | RE | 62 ms | 7716 KB |
04.txt | RE | 62 ms | 7716 KB |
05.txt | RE | 64 ms | 7716 KB |
06.txt | RE | 64 ms | 7716 KB |
sample_01.txt | RE | 63 ms | 7716 KB |
sample_02.txt | RE | 64 ms | 7716 KB |