CF27E.Number With The Given Amount Of Divisors

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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^{18}$ .

输入格式

The first line of the input contains integer $n$ ( $1<=n<=1000$ ).

输出格式

Output the smallest positive integer with exactly $n$ divisors.

输入输出样例

输入#1
```
4
```
输出#1
```
6
```
输入#2
```
6
```
输出#2
```
12
```

首页