codeforces 385C 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.

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.

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.

 

题目大意：找出[l,r]的素数，定义f(n)：对于一个素数n，xn中能整除n的个数。最后求f(n)的总和。

思路：在找素数的一起求和。

这题有个优化：本来题目要求是l,r,范围最大为10^9，很明显数组是开不下的。观察题目可以发现xn的最大值为10^7，而如果区间范围大于xn的时候，可以知道10^7后面的都为0。所以我们可以直接将数组开为10^7。

#include<stdio.h>
#include<string.h>
#include<math.h>
#define LL int 
#define M 10000005
bool a[M];
LL vis[M],c[M];
void isprime()
{	
	for(LL i=2;i<M;i++)
	{
		if(!a[i]){
			for(LL j=i;j<M;j+=i)
			{
				a[j]=1;
		
				c[i]+=vis[j];
			}
		}
	}
	for(LL i=2;i<M;i++)
	c[i]+=c[i-1];
}
int main()
{
	LL n,i,j,k,x,m,l,r;
	while(scanf("%d",&n)!=EOF)
	{
		memset(c,0,sizeof(c));
		memset(a,false,sizeof(a));
		memset(vis,0,sizeof(vis));
		for(i=0;i<n;i++)
		{
			scanf("%d",&x);
			vis[x]++;
		}
		isprime();
		scanf("%d",&m);
		while(m--)
		{
			scanf("%d%d",&l,&r);
			if(l>M)l=M-1;
			if(r>M)r=M-1;   //考虑边界问题。
			printf("%d\n",c[r]-c[l-1]);
		}
	}
	return 0;
}