[数学]cf226cBear and Prime Numbers

最新推荐文章于 2018-05-13 20:18:13 发布

dnldnth

最新推荐文章于 2018-05-13 20:18:13 发布

阅读量640

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/wu_yihao/article/details/18891551

版权

ACM 专栏收录该内容

62 篇文章 0 订阅

订阅专栏

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

You are given a sequence of integers x₁, x₂, ..., x_n of length n and m queries, each of them is characterized by two integers l_i, r_i. Let's introduce f(p) to represent the number of such indexes k, that x_k is divisible by p. The answer to the query l_i, r_i is the sum: $\text{[math]}$ , where S(l_i, r_i) is a set of prime numbers from segment [l_i, r_i] (both borders are included in the segment).

Help the bear cope with the problem.

Input

The first line contains integer n (1 ≤ n ≤ 10⁶). The second line contains n integers x₁, x₂, ..., x_n (2 ≤ x_i ≤ 10⁷). 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, l_i and r_i (2 ≤ l_i ≤ r_i ≤ 2·10⁹) — 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.

Sample test(s)

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.

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.
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.
The third query comes l = 4, r = 4. As this interval has no prime numbers, then the sum equals 0.

题意：询问某个个区间，求这个区间内的素数作为给出的数列里的数的质因数出现的次数之和。

预处理出数列中每个数出现的次数。利用了筛法，筛选的同时，由于质数的所有倍数都会枚举到，由此可以计算出每个质数在数列中作为质因数出现的次数。

筛选的同时还可以计算出前缀和。

算法复杂度为O(XlglgX+N+M)。险过。

#include <cstdio>

const int maxx = 1e7;
const int maxn = 1e6;

int a		[maxn+10];
int h		[maxx+10];
bool ntprm	[maxx+10];
int cnt		[maxx+10];

int main()
{
	int n,m;
	scanf("%d",&n);

	for (int i=1;i<=n;i++)
	{
		scanf("%d",a+i);
		h[a[i]] ++;
	}

	for (int i=2;i<=maxx;i++)
	{
		cnt[i] = cnt[i-1];
		if (!ntprm[i])
		{
			cnt[i] += h[i];
			for (int j=i*2;j<=maxx;j+=i)
			{
				ntprm[j] = true;
				cnt[i] += h[j];
			}
		}
	}

	scanf("%d",&m);
	for (int j=1;j<=m;j++)
	{
		int l,r;
		scanf("%d%d",&l,&r);
		if (l > 1e7) l = 1e7+1;
		if (r > 1e7) r = 1e7;
		int ans = cnt[r] - cnt[l-1];
		printf("%d\n",ans);
	}
	return 0;
}