Cf 361div2 C [二分]

原创 2016年08月30日 23:49:48

题目连接

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.

Sample Input

8

Sample Output

54

题意

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

题解

二分枚举答案,然后判断是否有n个四元组,判断的时候a不要傻傻地枚举判断这样复杂度就是O(n^2)了,x/k^3,枚举k即可。

代码

#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;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

汇编中有符号与无符号数以及CF,OF标志位的区分

汇编中有符号与无符号数以及CF,OF标志位的区分
  • zrf2112
  • zrf2112
  • 2016年05月01日 20:04
  • 4196

Objective-C 和 Core Foundation 对象相互转换的内存管理总结

Objective-C 和 Core Foundation 对象相互转换的内存管理总结iOS允许Objective-C 和 Core Foundation 对象之间可以轻松的转换,拿 NSString...
  • yiyaaixuexi
  • yiyaaixuexi
  • 2013年01月30日 21:26
  • 27136

基于用户的协同过滤(user-based CF)推荐系统【1】

一个基于用户的协同过滤推荐系统(user-based CF),给他加了一个用来计算该算法准确率和召回率的代码文件。...
  • u010454636
  • u010454636
  • 2016年07月06日 20:40
  • 3926

CF Round #361 (Div. 2) 689C. Mike and Chocolate Thieves

题意有四个编号固定的贼要偷巧克力,第i个贼偷的数量的第i-1个人的k倍,k>1且为整数,但是未知 每个贼的包的容量最大都是n,也未知 现在告诉你,他们偷巧克力可能的方案数为m, 求最小的满足条件的...
  • oulaline
  • oulaline
  • 2016年07月15日 17:50
  • 157

Cf Round #361 (Div. 2) 689D. Friends and Subsequences

题意给两个长度相同的整型数组a[],b[], 找到所有的l到r,使得l到r内的 a_max 与 b_min相同,输出满足条件的组数。题解稀疏表+二分搜索 稀疏表: 用da[i][j] 表示 数组a从...
  • oulaline
  • oulaline
  • 2016年07月15日 17:31
  • 123

Codeforces Round #361 (Div. 2) C.NP-Hard Problem

题目连接:http://codeforces.com/contest/688/problem/C 题意:给你一些边,问你能否构成一个二分图 题解:二分图:二分图又称作二部图,是图论中的一种特殊模型...
  • bin_gege
  • bin_gege
  • 2016年07月01日 20:35
  • 180

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

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

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

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

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

C. Diverse Permutation time limit per test 1 second memory limit per test 256 megabytes ...
  • u013447865
  • u013447865
  • 2014年10月29日 09:23
  • 546

CF-Codeforces Round #410 (Div. 2)-A~C

ACM模版很少打 CF,最近开始正儿八经的打 CF 了,以前不打是因为看英语题感觉累,但是以后这个是避免不了的,平时也需要多训练才行,所以现在开始折腾 CF 了……由于前三题都十分简单,只要看懂题,就...
  • f_zyj
  • f_zyj
  • 2017年04月23日 12:27
  • 392
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Cf 361div2 C [二分]
举报原因:
原因补充:

(最多只允许输入30个字)