ZOJ_3224 Mathematics(数论)

Mathematics

Time Limit: 1000 ms Memory Limit: 32768 KB

Problem Description

Mathematics is always attractive. For example, Fourier Transform can split a normal function into parts with Sin function and Cos function, which shows magical properties. Log function can change a number in a huge range to a very small range. And Z-Transform can transform a complex signal into a new function to simplify the analysis.

Navi likes mathematics very much (Although he does not major in math). Especially he likes the Log function. Because with different base number chosen, a number n will be change to different number via function Log. What’s more, he is currently considering numbers satisfying a special condition, which is, for a given number a, the number n is divisible by $[Lo{g}_{a}n]$, where $[n]$ means the greatest integer less then or equal to n.

Now Navi has generated some numbers and stored them in array a. He wants to find out the number of numbers n in interval $[A,B]$ satisfying $[Lo{g}_{a_i}n]$ is positive and n is divisible by $[Lo{g}_{a_i}n]$, for all $a_i$.

Input

There will be no more than 20 cases.
The first line of each case will be three integers N, A, B ($1<=N<=500$, $5<=A<=B<=2^{31}-1$). The second line contains N numbers $a_1...a_N$, $2<=a_i<=10000$.

Output

One line per case, the number of numbers in [A, B] satisfying the condition above.

Sample Input

1 6 6
2
2 5 14
2 3

Sample Output

1
2

题意

n个数$a_i$，求区间$[a,b]$满足对于所有$a_i$都有$\lfloor lo{g}_{a_i}n\rfloor |n$的整数的数量。

题解：

区间很大，但对于每个$a_i$，最多可将按$\lfloor lo{g}_{a_i}n\rfloor$的值区间分为30+段，每段为$[a_i,a_i^2),[a_i^2,a_i^3).....$，所以对于$a_i$求出其分段，对于每段求出n个$a_i$分段的lcm，求出段区间内有多少个数能整除lcm即可。

#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<map>
#include<vector>
#include<queue>
#include<iterator>
#define dbg(x) cout<<#x<<" = "<<x<<endl;
#define INF 0x3f3f3f3f
#define eps 1e-7
 
using namespace std;
typedef long long LL;   
typedef pair<int, int> P;
const int maxn = 1020;
const int mod = 998244353;
struct node{
    int x;
    LL pos;
}p[maxn*30];
int c[maxn], d[42];
bool cmp(node a, node b);
LL gcd(LL a, LL b);
LL solve(LL l, LL r, LL lc);

int main()
{
    int top, n, i, j, k;
    LL x, ans, a, b;
    while(~scanf("%d %lld %lld", &n, &a, &b))
    {
        top = 0;
        ans = 0;
        memset(d, 0, sizeof(d));
        for(i=0;i<n;i++){
            scanf("%d", &c[i]);
            x = 1;
            for(j=1;j<=32 && x<=b;j++)
            {
                x *= c[i];
                p[top].pos = x;
                p[top].x = j;
                top++;
            }
        }
        p[top].pos = 1e13, p[top].x = 50;
        top++;
        sort(p, p+top, cmp);
        for(i=0;i<top;){
            for(k=i;k<top && p[k].pos == p[i].pos;k++)
                d[p[k].x]++, d[p[k].x-1]--;
            int num = 0;
            x = 1;
            for(j=1;j<=33;j++)
                if(d[j]){
                    num+=d[j];
                    x = x/gcd(x, j)*j;
                }
            if(num == n){
                ans += solve(max((LL)a, p[i].pos), min((LL)b, p[k].pos-1), x);
            }
            i = k;
        }
        printf("%lld\n", ans);
    }
    return 0;
}

LL gcd(LL a, LL b)
{
    return b==0?a:gcd(b, a%b);
}

bool cmp(node a, node b)
{
    return a.pos < b.pos;
}

LL solve(LL l, LL r, LL lc)
{
    if(l>r)return 0LL;
    return r/lc-(l-1)/lc;
}