CodeForces 27E Number With The Given Amount Of Divisors

E. Number With The Given Amount Of Divisors

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Given the number n, find the smallest positive integer which has exactly n divisors. It is guaranteed that for the given n the answer will not exceed 10¹⁸.

Input

The first line of the input contains integer n (1 ≤ n ≤ 1000).

Output

Output the smallest positive integer with exactly n divisors.

Sample test(s)

Input

4

Output

6

Input

6

Output

12

题目大意：给一个n，问因子数为n的最小整数是多少

方法根据结论暴搜，

结论是:任何一个数都可以拆成非负整数和质数相乘的乘积，而题目的范围是10^18，假设这些质数都是最小的2，非负整数都是1，那么只需要2^64次方就可以超过10^18,也就意味着，暴力的枚举64次质数累乘的结果是可行的。

好了，那便DFS暴搜吧！

注意，搜索过程中到达因子个数为n的有很多个数，所以要取小值不断更新,还有要用long long保存结果.

#include <stdio.h>
#include <algorithm>
using namespace std;

const long long MAXN=1e18 + 5;
int n;
long long ans=MAXN;
int primTable[11]={2,3,5,7,11,13,17,19,23,29,31};

void dfs(int totalCnt,int primeNumberIndex,long long currentNumberValue)
{
        if(totalCnt>n)
                return;
        if(totalCnt==n)
        {
                ans=min(currentNumberValue,ans);
                return;
        }
        for(int i=1 ; i<=64 ; i++)
        {
                if(currentNumberValue*primTable[primeNumberIndex]>ans)
                        return;
                currentNumberValue*= primTable[primeNumberIndex];
                dfs(totalCnt*(i+1) , (primeNumberIndex+1) , currentNumberValue);
        }

}

int main()
{
        scanf("%d",&n);
        dfs(1,0,1);
        printf("%I64d\n",ans);
        return 0;
}