zoj 2562 More Divisors（反素数）

More Divisors

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

Everybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say that it is so because men have ten fingers. Maybe they are right. However, this is often not very convenient, ten has only four divisors -- 1, 2, 5 and 10. Thus, fractions like 1/3, 1/4 or 1/6 have inconvenient decimal representation. In this sense the notation with base 12, 24, or even 60 would be much more convenient.

The main reason for it is that the number of divisors of these numbers is much greater -- 6, 8 and 12 respectively. A good quiestion is: what is the number not exceeding n that has the greatest possible number of divisors? This is the question you have to answer.

Input:

The input consists of several test cases, each test case contains a integer n (1 <= n <= 10¹⁶).

Output:

For each test case, output positive integer number that does not exceed n and has the greatest possible number of divisors in a line. If there are several such numbers, output the smallest one.

Sample Input:

10
20
100

Sample Output:

6
12
60

题意：给出一个n，求出n以内最小的数满足这个数的因数个数最多。

思路：这题需要知道反素数这个概念。对于任何正整数x,其约数的个数记做g(x).例如g(1)=1,g(6)=4.   如果某个正整数x满足:对于任意i(0<i<x),都有g(i)<g(x),则称x为反素数。

性质：

1. 一个反素数的所有质因子必然是从2开始的若干个质数，因为一个数是反素数，说明在跟它约数相同的数中，它是最小的。
2. 如果n=2^t1 * 3^t2 * 5^t3 *...,那么一定有t1>=t2>=t3>=t4... 另外易知如果n=2^t1* 3^t2 * 5^t3 * ...,那么n的约数个数为(t1+1) *(t2+1) * (t3+1)...

代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>
#include <vector>
#include <math.h>
using namespace std;
#define ll long long
int prime[]={1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
const ll INF = 0x3f3f3f3f;
ll n;
ll ans;
int maxn;
void dfs(ll num,int k,int sum,int limit)//num: 当前枚举到的数 k:枚举到的第k大的质因子 sum:该数的约数个数 limit：质因子个数上限(重要剪枝)
{
    if(sum>maxn)
    {
        maxn=sum;
        ans=num;
    }
    if(maxn==sum&&ans>num)
    {
        ans=num;
    }
    if(k>16)
        return;
    ll temp=num;
    for(int i=1;i<=limit;i++)
    {
        if(n/prime[k]<temp)
            return;
        temp*=prime[k];
        dfs(temp,k+1,sum*(i+1),i);
    }
}
int main()
{
    while(~scanf("%lld",&n))
    {
        ans=INF*INF;
        maxn=0;
        dfs(1,1,1,64);
        printf("%lld\n",ans);
    }
    return 0;
}