Codeforces Round #226 (Div. 2) C. Bear and Prime Numbers（素数筛法）

最新推荐文章于 2022-07-13 02:01:45 发布

HonniLin

最新推荐文章于 2022-07-13 02:01:45 发布

阅读量729

点赞数

分类专栏：简单数论文章标签： Codeforces

本文链接：https://blog.csdn.net/sotifish/article/details/43405531

版权

简单数论专栏收录该内容

26 篇文章 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.

题意：

给你n个数，求出能够整除区间【l,r】之间的质数的总个数，一共有m个区间求和，每个区间输出答案。

思路：

使用数组标记输入的数。

数的大小是1e7，在2~1e7+5这个区间内进行素数筛法，顺便统计前n个质数的整除数的个数和。

～～～～～～～～～`

一开始的思路是对每一个数的质因子记录起来，记录n个数的每一出现质因子的总个数。但是在这个地方会超时，因为对于每一个数最大要32次才能求出全部的质因子（2的32方 >= 1e7）,再遍历n个数的话t = 32*1e7，超过了2e8(时限2s)。

CODE：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;
const int maxn = 1e7+10;
int sum[maxn],ex[maxn];
bool ispri[maxn];

void sum_pri()
{
    memset(ispri, 0, sizeof(ispri));
    for(int i = 2; i < maxn; ++i) {
        if(!ispri[i]) {
            for(int j = i; j < maxn; j+=i) {
                ispri[j] = 1;
                sum[i] += ex[j];
            }
        }
        sum[i] += sum[i-1];
    }
}
int main()
{
//freopen("in", "r", stdin);
    int n;
    while(~scanf("%d", &n)) {
        memset(ex, 0, sizeof(ex));
        memset(sum, 0, sizeof(sum));

        int num;
        for(int i = 0; i < n; ++i) {
            scanf("%d", &num);
            ex[num] ++;
        }

        sum_pri();

        int m;
        scanf("%d", &m);
        while(m--) {
            int lef, rig;
            scanf("%d %d", &lef, &rig);
            if(rig > 1e7) rig = 1e7;
            if(lef >= 1e7) printf("0\n");
            else printf("%d\n", sum[rig] - sum[lef-1]);
        }
    }
    return 0;
}