uva294 Divisors

最新推荐文章于 2019-10-23 14:08:17 发布

sdfzyhx

最新推荐文章于 2019-10-23 14:08:17 发布

阅读量359

点赞数

分类专栏：数学 UVa 文章标签：线性筛唯一分解

本文链接：https://blog.csdn.net/sdfzyhx/article/details/52515345

版权

数学同时被 2 个专栏收录

229 篇文章 0 订阅

订阅专栏

UVa

137 篇文章 0 订阅

订阅专栏

Description Download as PDF

Mathematicians love all sorts of odd properties of numbers. For
instance, they consider 945 to be an interesting number, since it is
the first odd number for which the sum of its divisors is larger than
the number itself.

To help them search for interesting numbers, you are to write a
program that scans a range of numbers and determines the number that
has the largest number of divisors in the range. Unfortunately, the
size of the numbers, and the size of the range is such that a too
simple-minded approach may take too much time to run. So make sure
that your algorithm is clever enough to cope with the largest possible
range in just a few seconds.

Input Specification

The first line of input specifies the number N of ranges, and each of
the N following lines contains a range, consisting of a lower bound L
and an upper bound U, where L and U are included in the range. L and U
are chosen such that tex2html_wrap_inline42 and tex2html_wrap_inline44
.

Output Specification

For each range, find the number P which has the largest number of
divisors (if several numbers tie for first place, select the lowest),
and the number of positive divisors D of P (where P is included as a
divisor). Print the text ‘Between L and H, P has a maximum of D
divisors.’, where L, H, P, and D are the numbers as defined above.

因为l..r不大，所以可以暴力枚举每个数统计因数个数。
先打出来素数表，然后用每个素数试除，记指数分别为p1,p2,…,pn，则因子个数为(p1+1) * (p2+1) * … * (pn+1)。
时间复杂度((r-l) * sqrt(r)/log(sqrt(l)))。

#include<cstdio>
#include<cstring>
int prm[40010],tot;
bool have[40010];
int cnt(int x)
{
    int ans=1,p,q;
    for (int i=1;i<=tot&&x>1;i++)
      if (x%prm[i]==0)
      {
        p=0;
        while (x%prm[i]==0)
        {
            p++;
            x/=prm[i];
        }
        ans*=p+1;
      }
    if (x>1) ans*=2;
    return ans;
}
int main()
{
    int i,j,k,m,n,p,q,x,y,z,T,l,r;
    for (i=2;i<=40000;i++)
    {
        if (!have[i]) prm[++tot]=i;
        for (j=1;j<=tot&&i*prm[j]<=40000;j++)
        {
            have[i*prm[j]]=1;
            if (i%prm[j]==0) break;
        }
    }
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d%d",&l,&r);
        p=l;
        q=cnt(l);
        for (i=l+1;i<=r;i++)
        {
            x=cnt(i);
            if (x>q)
            {
                q=x;
                p=i;
            }
        }
        printf("Between %d and %d, %d has a maximum of %d divisors.\n",l,r,p,q);
    }
}