Codeforces 385C 数学

传送门：点击打开链接

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 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: , 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.

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.

题意：给出一个长度为n的数组x.定义f(p)函数为在数组x中能被p整除的数的个数。对于每一个询问Li,Ri。求p为Li到Ri之间的素数的f(p)的值的和。

思路：当然，先要求出所有小于1000W的所有素数（从小到大排列）。

可以先预处理出所有f函数的值，然后求出f的前缀和,记为F[i]，查询Li，Ri的时候，用F[Ri]-F[Li-1]求出答案。

对于每一个f(i)值，很容易得出f(i)=sigm(cnt[i*k]) k为大于0的整数，cnt[i]代表i在数组x中出现的次数（读入的时候预处理）。

#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
int cnt[10000007];
bool isprime[10000007];
int prime[670000];
int prime_num;
int sum[670000];
void init()
{
    memset(isprime,1,sizeof(isprime));
    for(LL i=2;i<=10000000;i++)
    if(isprime[i])
    {
        for(LL j=i*i;j<=10000000;j+=i) isprime[j]=0;
    }
    prime_num=0;
    for(int i=2;i<=10000000;i++) if(isprime[i]) prime[++prime_num]=i;
}
int main()
{
    init();
    memset(cnt,0,sizeof(cnt));
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        int x;
        scanf("%d",&x);
        cnt[x]++;
    }
    memset(sum,0,sizeof(sum));
    for(int i=1;i<=prime_num;i++)
    {
        for(int j=prime[i];j<=10000000;j+=prime[i]) sum[i]+=cnt[j];
    }
    for(int i=1;i<=prime_num;i++) sum[i]+=sum[i-1];
    int q;
    scanf("%d",&q);
    while(q--)
    {
        int l,r;
        scanf("%d %d",&l,&r);
        if(r>10000000) r=10000000;
        if(l>10000000) l=10000000;
        int lp,rp;
        lp=lower_bound(prime+1,prime+1+prime_num,l)-prime-1;
        rp=upper_bound(prime+1,prime+1+prime_num,r)-prime-1;
        printf("%d\n",sum[rp]-sum[lp]);
    }
    return 0;
}

由于给了512M的内存，以上的数组都能开下。

代码：