Submission #4074994
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 | Python (3.4.3) |
Score | 0 |
Code Size | 816 Byte |
Status | TLE |
Exec Time | 2109 ms |
Memory | 26124 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
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 | TLE | 2109 ms | 24608 KB |
02.txt | TLE | 2109 ms | 26124 KB |
03.txt | TLE | 2109 ms | 24580 KB |
04.txt | TLE | 2109 ms | 24648 KB |
05.txt | TLE | 2109 ms | 21388 KB |
06.txt | TLE | 2109 ms | 23060 KB |
07.txt | TLE | 2109 ms | 24608 KB |
sample_01.txt | AC | 150 ms | 12416 KB |
sample_02.txt | AC | 161 ms | 12416 KB |
sample_03.txt | AC | 151 ms | 12416 KB |