Submission #2542077

---

Source Code Expand

q = int(input())
l = list(range(2, 10**5+1))
prime = [1]*(10**5+1)
prime[0], prime[1] = 0, 0
temp = [0]*(10**5+1)
counts = [0]*(10**5+1)
ans = 0
for i in range(2, int((10**5)**0.5) + 1):
  if not prime[i]:
    continue

  for j in range(i*2, int(10**5) + 1, i):
    prime[j] = 0

for i in range(2, 10**5):
  if prime[i] == 1 and prime[(i+1)//2] == 1:
    temp[i] = 1

for i in range(1, 10**5+1):
  temp[i] += temp[i-1]

for i in range(q):
  l, r = map(int, input().split())
  print(temp[r]-temp[l-1])

Submission Info

Judge Result