Divisors UVA - 294

最新推荐文章于 2021-05-21 11:02:51 发布

Qingzhx

最新推荐文章于 2021-05-21 11:02:51 发布

阅读量134

点赞数

本文链接：https://blog.csdn.net/Qingzhx/article/details/105451100

版权

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

ll a,b;

ll solve(ll x){
    ll m=sqrt(x+0.5);
    ll flag=1;
    for(ll i=2;i<=m;++i){
        if(x%i==0){
            ll cnt=0;
            while(x%i==0){
                x/=i;
                ++cnt;
            }
            flag*=cnt+1;//n个重复新因子组成n个新因子，每多n个新因子，则因子多n倍，变为n+1倍
            if(x==1) break;
        }
    }
    if(x>1) flag*=2;//x>1表示有一个未统计的因子，使因子总数翻倍
    return flag;
}

int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%lld%lld",&a,&b);
        ll x,flag=0;
        for(ll i=a;i<=b;++i){
            ll tmp=solve(i);
            if(tmp>flag){
                flag=tmp;
                x=i;
            }
        }
        printf("Between %lld and %lld, %lld has a maximum of %lld divisors.\n",a,b,x,flag);
    }
    return 0;
}