跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2191. Bear and Prime Numbers

  • ID: 2197
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 二分
  • 枚举
  • 数据结构
  • 动态规划
  • 模拟
  • 数学
  • 数论
  • 算法思想
  • 编程与模拟
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Bear and Prime Numbers

题目描述

C. Bear and Prime Numbers
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

Recently, the bear started studying data structures and faced the following problem.

You are given a sequence of integers x1,x2,...,xn of length n and m queries, each of them is characterized by two integers li,ri. Let's introduce f(p) to represent the number of such indexes k, that xk is divisible by p. The answer to the query li,ri is the sum: , where S(li,ri) is a set of prime numbers from segment [li,ri] (both borders are included in the segment).

Help the bear cope with the problem.

Input

The first line contains integer n (1≤n≤106). The second line contains n integers x1,x2,...,xn (2≤xi≤107). The numbers are not necessarily distinct.

The third line contains integer m (1≤m≤50000). Each of the following m lines contains a pair of space-separated integers, li and ri (2≤li≤ri≤2·109) − the numbers that characterize the current query.

Output

Print m integers − the answers to the queries on the order the queries appear in the input.

Examples
Input
6
5 5 7 10 14 15
3
2 11
3 12
4 4
Output
9
7
0
Input
7
2 3 5 7 11 4 8
2
8 10
2 123
Output
0
7
Note

Consider the first sample. Overall, the first sample has 3 queries.

  1. The first query l=2, r=11 comes. You need to count f(2)+f(3)+f(5)+f(7)+f(11)=2+1+4+2+0=9.
  2. The second query comes l=3, r=12. You need to count f(3)+f(5)+f(7)+f(11)=1+4+2+0=7.
  3. The third query comes l=4, r=4. As this interval has no prime numbers, then the sum equals 0.

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1795 题。保留原作者与原赛事署名。