Codeforces 689.C Mike and Chocolate Thieves 二分+数学

    二分专题，见题目：

Description

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.

Input

The single line of input contains the integer m(1 ≤ m ≤ 10¹⁵) — the number of ways the thieves might steal the chocolates, as rumours say.

Output

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.

Sample Input

Input

1

Output

8

Input

8

Output

54

Input

10

Output

-1

Hint

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.

    题意：有四个小偷，第一个小偷偷a个巧克力，后面几个小偷依次偷a*k,a*k*k,a*k*k*k个巧克力，现在知道小偷有n中偷法，求在这n种偷法中偷得最多的小偷的所偷的最小值。

    该题是二分法和数学转换相结合的一道题。根据二分法思想只需要判断最大值为mid时，满足的四元组和n之间的大小关系，当check（mid）值不小于所给n时，因为题目所求为最大值的最小值，所以选择左半区间缩小范围，反之很容易理解不赘述。

    该题的关键点在于验证mid的check（n）函数，每组四元组中最大的是a*k*k*k，其小于n，所以k的三次方小于n，而在乘数为k时满足条件四元组的个数即为n/(k*k*k)即确定了k第一个小偷偷的个数决定不同元祖，考虑到这一点很容易验证。

    给出AC代码：

#include<stdio.h>
typedef long long ll;
ll check(ll n)
{
	ll res=0;
	for(ll k=2; k*k*k<=n; k++)//k是ll范围  不可犯糊涂 
		res+=n/(k*k*k);
	return res;
}
int main()
{
	ll m,res=-1,l=1,r=1e18,mid;
	scanf("%I64d",&m);
	while(r>=l)
	{
		mid=(l+r)/2;
		ll num= check(mid);
		if(num==m)
			res=mid;
		if(num>=m)
			r=mid-1;
		else
			l=mid+1;
	}
	printf("%I64d\n",res);
}

    虽然举步维艰但是还是能感受到一点一点的进步，这就足够了。

    特记下，以备后日回顾。