Codeforces 689C Mike and Chocolate Thieves (二分)
来源:互联网 发布:java图片上传跨域请求 编辑:程序博客网 时间:2024/05/17 06:55
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 exactlyk times more than the previous one. The value ofk (k > 1) is a secret integer known only to them. It is also known that each thief's bag can carry at mostn chocolates (if they intend to take more, the deal is cancelled) and that there wereexactly 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 fixedn, but not fixed k) ism. 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 ofn 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 suchn.
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 onen satisfying the rumors, print the smallest one.
If there is no such n for a false-rumouredm, print - 1.
1
8
8
54
10
-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 exactly10 ways of stealing chocolates in the third sample case.
题目链接:http://codeforces.com/problemset/problem/689/C
题目大意:给一个数字n,要求结果正好包含n个四元组,求这n个四元组里的最大值,四元组形式为一个等比数列
题目分析:因为只有四个数,显然最后一个是第一个的x^3倍,二分答案,枚举x计算四元组个数即可。
#include <cstdio>#include <iostream>#define ll long longusing namespace std;ll cal(ll x){ll num = 0;for(ll i = 2; i * i * i <= x; i++)num += x / (i * i * i);return num;}int main(){ll n;cin >> n;ll r = 1e18, l = 1, mid, ans = -1;while(l <= r){mid = (l + r) >> 1;ll p = cal(mid);if(p == n)ans = mid;if(p >= n)r = mid - 1;elsel = mid + 1;}cout << ans << endl;}
- Codeforces 689C Mike and Chocolate Thieves (二分)
- Codeforces 689C. Mike and Chocolate Thieves(二分)
- Codeforces 689C Mike and Chocolate Thieves【二分+思维】
- CodeForces-689C.Mike and Chocolate Thieves
- CodeForces 689C Mike and Chocolate Thieves
- Codeforces-689C-Mike and Chocolate Thieves
- Codeforces #361C. Mike and Chocolate Thieves 二分 数学
- Codeforces 678C Mike and Chocolate Thieves(二分)
- Codeforces 689.C Mike and Chocolate Thieves 二分+数学
- 【打CF,学算法——三星级】CodeForces 689C Mike and Chocolate Thieves (二分)
- Codeforces 689C-Mike and Chocolate Thieves(求下界的二分查找)
- Codeforces Round #361 (Div. 2) C. Mike and Chocolate Thieves 二分
- Codeforces Round #361 (Div. 2) C. Mike and Chocolate Thieves(二分判断)
- cf#361-C - Mike and Chocolate Thieves-二分
- Codeforces Round #361 (Div. 2) C. Mike and Chocolate Thieves
- Codeforces Round #361 (Div. 2) C - Mike and Chocolate Thieves
- Codeforces Round #361 (Div. 2)C. Mike and Chocolate Thieves
- Codeforces Round #361 (Div. 2) C. Mike and Chocolate Thieves
- C++ virtual关键字深入理解
- Win10Matlab7Runtime Error
- hdu 4751 Divide Groups bfs 搜索 解题报告
- 传球游戏_vijos1485
- 构造方法中super()的作用
- Codeforces 689C Mike and Chocolate Thieves (二分)
- Qt学习笔记——QTableWidget使用问题
- 异常处理基础(C#参考)
- 四大内部类
- leetcode——Isomorphic Strings
- 领域建模有很多种方法,对于同样的问题域使用不同的建模手段得到的模型可能也不尽相同。于是我经常听到这样一个问题:怎么才能保证建模的正确性?
- 用NSJSONSerialization解析NSURLSession中的json数据
- 我的linux命令笔记
- 网络状态监测