CF689C.Mike and Chocolate Thieves
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Bad news came to Mike's village, some thieves stole a bunch of chocolates from the local factory! Horrible!
Aside from loving sweet things, thieves from this area are known to be very greedy. So after a thief takes his number of chocolates for himself, the next thief will take exactly k times more than the previous one. The value of k ( k>1 ) is a secret integer known only to them. It is also known that each thief's bag can carry at most n chocolates (if they intend to take more, the deal is cancelled) and that there were exactly four thieves involved.
Sadly, only the thieves know the value of n , but rumours say that the numbers of ways they could have taken the chocolates (for a fixed n , but not fixed k ) is m . Two ways are considered different if one of the thieves (they should be numbered in the order they take chocolates) took different number of chocolates in them.
Mike want to track the thieves down, so he wants to know what their bags are and value of n will help him in that. Please find the smallest possible value of n or tell him that the rumors are false and there is no such n .
输入格式
The single line of input contains the integer m (1<=m<=1015) — the number of ways the thieves might steal the chocolates, as rumours say.
输出格式
Print the only integer n — the maximum amount of chocolates that thieves' bags can carry. If there are more than one n satisfying the rumors, print the smallest one.
If there is no such n for a false-rumoured m , print −1 .
输入输出样例
输入#1
1
输出#1
8
输入#2
8
输出#2
54
输入#3
10
输出#3
-1
说明/提示
In the first sample case the smallest n that leads to exactly one way of stealing chocolates is n=8 , whereas the amounts of stealed chocolates are (1,2,4,8) (the number of chocolates stolen by each of the thieves).
In the second sample case the smallest n that leads to exactly 8 ways is n=54 with the possibilities: (1,2,4,8), (1,3,9,27), (2,4,8,16), (2,6,18,54), (3,6,12,24), (4,8,16,32), (5,10,20,40), (6,12,24,48) .
There is no n leading to exactly 10 ways of stealing chocolates in the third sample case.