巧用素数筛2

最新推荐文章于 2020-09-11 08:29:59 发布

Davenny

最新推荐文章于 2020-09-11 08:29:59 发布

阅读量293

点赞数

本文链接：https://blog.csdn.net/Davenny/article/details/51965201

版权

Description
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 Input
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
Hint
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.

刚开始的时候还想着可能会用到树状数组什么的，结果还不如人家用暴力呢~

#include <cstdio>
#include <iostream>
using namespace std;
const int Max=10000010;
int n,cnt[Max],vis[Max],is[Max],m,a,b,t;
void init()
{
    for(int i=2;i<Max;i++)
    {
        if(!is[i])
        {
            cnt[i]+=vis[i];
            for(int j=i+i;j<Max;j+=i)
                is[j]=1,cnt[i]+=vis[j];
        }
    }
    for(int i=2;i<Max;i++)
        cnt[i]+=cnt[i-1];
}
int main()
{
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&t);
        vis[t]++;
    }
    init();
    scanf("%d",&m);
    while(m--)
    {
        scanf("%d%d",&a,&b);
        if(a>Max-1) a=Max-1;
        if(b>Max-1) b=Max-1;
       // cout<<"----"<<cnt[b]<<" "<<cnt[a-1]<<endl;
        printf("%d\n",cnt[b]-cnt[a-1]);
    }
    return 0;
}