# Cf 361div2 C [二分]

## 题目连接

http://codeforces.com/contest/689/problem/C

## 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 ≤ 1015) — 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.

8

54

## 题意

ak，ak^2，ak^3，ak^4，找出恰好满足一定数量的四元组的最小价值数，如果没有则输出-1。

## 代码

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n;
const ll INF=1e16;
ll solve(ll x)
{   ll num=0;
for(ll k=2;k<=x;k++)
{
if(k*k*k<=x)num+=x/(k*k*k);
else break;
}

return num;
}

int main()
{

scanf("%I64d",&n);
ll ans=INF;
ll le=1,ri=INF,mi;
for(int i=0;i<100;i++)
{   mi=(le+ri)/2;
ll jj=solve(mi);
if(jj==n){ans=min(ans,mi);ri=mi;}
else if(jj<n)le=mi;
else ri=mi;
}
//    ll le=0,ri=1e16,mi;
//    while(le<=ri)
//    {
//        mi=(le+ri)/2;
//        if()le=mi+1;
//        ri=mi-1
//    }
if(ans==INF)printf("-1\n");
else printf("%I64d\n",ans);
return 0;
}


• 本文已收录于以下专栏：

## Codeforces Round #361 (Div. 2) A,B,C,D

A. Mike and Cellphone 题意：给一串在手机10位键盘上手指的移动轨迹，问是否可以确定移动轨迹经过的数字。 思路：模拟，存在很多坑。我的想法是求出横纵最大坐标的差值，用差值做标准...

## Codeforces Round #361 (Div. 2) 题解 粗鲁地二分 组合数学提炼模型

A 水 B 一条直线上的点之间钻来钻去，优先队列BFS，穷人版最短路 C m在10的15次方，涉及到k的3次方，小范围打表找规律，发现结果n约等于6倍m，确定n的范围在8*10的15次方以内，二分n是...

## CF 141 Div2 C Fractal Detector(状态压缩DP)

C. Fractal Detector time limit per test 4 seconds memory limit per test 256 megabytes ...
• fp_hzq
• 2012年10月23日 19:16
• 819

## CF_#277.5_DIV2_A_B_C

http://codeforces.com/contest/489/problem/A A. SwapSort 给定一个n个序列

## CF#275 (Div. 2) C（数学构造）

C. Diverse Permutation time limit per test 1 second memory limit per test 256 megabytes ...

举报原因： 您举报文章：Cf 361div2 C [二分] 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)