hdu_4430_策略二分经典
来源:互联网 发布:淘宝拍卖车不可过户 编辑:程序博客网 时间:2024/05/17 02:55
Today is Yukari’s n-th birthday. Ran and Chen hold a celebration party for her. Now comes the most important part, birthday cake! But it’s a big challenge for them to place n candles on the top of the cake. As Yukari has lived for such a long long time, though she herself insists that she is a 17-year-old girl.
To make the birthday cake look more beautiful, Ran and Chen decide to place them like r ≥ 1 concentric circles. They place ki candles equidistantly on the i-th circle, where k ≥ 2, 1 ≤ i ≤ r. And it’s optional to place at most one candle at the center of the cake. In case that there are a lot of different pairs of r and k satisfying these restrictions, they want to minimize r × k. If there is still a tie, minimize r.
Input
There are about 10,000 test cases. Process to the end of file.
Each test consists of only an integer 18 ≤ n ≤ 1012.
Output
For each test case, output r and k.
Sample Input
18
111
1111
Sample Output
1 17
2 10
3 10
题意:
给蛋糕插r圈蜡烛,中间插不插都可以,第i圈 插k的i次方个,然后求在r*k(值相同时取r最小)最小的情况下的r ,k值已知总蜡烛数n
解:
由题得蜡烛的总数可近似为一个等差数列,知道r最大为40多.
然后对每个r二分求解k,注意二分时k的范围;
#include<bits/stdc++.h>using namespace std;#define ll long longll solve(ll a,ll b){ ll ans=1; while(b) { if(b&1) ans*=a; b>>=1; a*=a; } return ans;}int main(){ ll n,i,j; while(cin>>n) { ll a=1,b=n-1; for(i=2;i<41;i++) { ll low=2,high=pow(n,1.0/i),k; while(low<=high) { k=(low+high)/2; ll ans=k*(1-solve(k,i))/(1-k); if(ans==n||ans==n-1) { if(k*i<a*b) { a=i;b=k; } } if(ans>n) high=k-1; else low=k+1; } } cout<<a<<" "<<b<<endl; } return 0;}
- hdu_4430_策略二分经典
- 二分 二分经典题目
- 【从零学习经典算法系列】分治策略实例——二分查找
- 【经典算法】二分查找
- 经典的二分查找
- 经典二分穷举
- 二分搜索经典题目
- 【经典算法】:二分查找
- 经典二分算法详解
- 经典二分查找问题
- codeforces672D(经典二分)
- hdu_1083_经典二分图
- 经典二分查找问题
- 经典二分查找问题
- 经典二分查找问题
- 经典二分题----光合作用
- ClearCase的备份策略(经典)
- ClearCase的备份策略(经典)
- 排序--选择排序
- 使用栈实现十进制数转化成其他进制
- Java之多线程Runnable(1)卖票-yellowcong
- 685. Redundant Connection II
- CTEX使用bib生成文献的问题解决。
- hdu_4430_策略二分经典
- java集合讲解
- vue 传值的几种方式
- PrintWriter中write和print方法的区别
- STM32定时器---正交编码器模式详解
- 全局获取Context、Intent传递对象、日志类
- 【Java】在Java中如何判断一个对象属于一个类
- SQL truncate 、delete与drop区别
- JSSDK实现微信分享功能