codeforces 226 div2

A,B水题

C题

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.

一开始又在意淫线段树，不断RE

然后开始问某同学，两个人合伙搞都没搞出来

最后发现

for(int i=1;i<=N;i++)
        sum[i]+=sum[i-1];

这样就能使查询变成O（1）  欲哭无泪

#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
using namespace std;
const int N=10000000;
bool prime[N+10];
int  p[1111111],a;
int  k=0;
int sum[N+1];
void getprime()
{

    k=0;

    memset(prime,0,sizeof(prime));

    prime[1]=1;

    for(int i=2;i<=N;i++)

    {

        if(!prime[i])p[k++]=i;

        for(int j=0;j<k && p[j]*i<=N;j++)

        {

            prime[p[j]*i]=1;

            if(i%p[j]==0)break;

        }

    }

}

void ans(int x)
{
    for(int i=0;i<k;i++)
    {
        if(!prime[x])
        {
            sum[x]++;
            break;
        }
        if(p[i]>x)
            break;
        if(x%p[i]==0)
        {
            sum[p[i]]++;
            while (x%p[i]==0)
                x/=p[i];

        }
    }
}
int main()
{
    int n,m,a,x,y,i;
    getprime();
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a);
        ans(a);
    }
    for(int i=1;i<=N;i++)
        sum[i]+=sum[i-1];
    scanf("%d",&m);
    while(m--)
    {
        scanf("%d%d",&x,&y);
        cout<<sum[min(N,y)]-sum[min(N,x-1)]<<endl;
    }
    return 0;
}

等我想出227div2 C题做法。。。绝壁不能看题解

我的思路 从后往前找有多少个越来越大的数，然后对每个数又实行这样的找法，递归？