ZOJ 3665 Yukari's Birthday
2012-10-18 23:21
155 查看
枚举r二分k
#include <iostream> #include <cstdio> #include <cmath> #define ll long long using namespace std; ll n,r; ll pow1(ll mid,ll r) { ll t=1; for(ll i=1;i<=r;++i) { t*=mid; } return t; } ll solve(ll low,ll high) { if(low>high) return -1; else { ll mid=(low+high)/2; ll temp=mid*(1-pow1(mid,r))/(1-mid); if(temp==n||temp==n-1) return mid; else if(temp>n) return solve(low,mid-1); else return solve(mid+1,high); } } int main() { while (scanf("%lld",&n)!=EOF) { ll ansr=1; ll ansk=n-1; ll min=n-1; ll k,high; for(r=2;r<=42;++r) { high=(ll) pow(n+1.0,1.0/r)+1; k=solve(2,high); if(k!=-1) { if(k*r<min) { ansk=k; ansr=r; } if(k*r==min&&r<ansr) { ansr=r; ansk=k; } } } printf("%lld %lld\n", ansr, ansk); } return 0; }
相关文章推荐
- HDU 3788 ZOJ问题
- zoj 3480
- zoj1002 FIRE NET(搜索算法DFS)
- ZOJ 2706 Thermal Death of the Universe (线段树)
- ZOJ1709 || POJ 1562 DFS 水 求强连通的个数
- zoj 1409 Communication System
- ZOJ 3810 Pretty Poem
- ZOJ 3471Most Powerful(状态压缩DP)
- ZOJ 2724 Windows Message Queue(优先队列)
- 阶乘浅析poj1150 3406 zoj1222 2358
- ZOJ -- 2317(矩阵快速幂 + 大数简单处理)
- zoj 3158 DFS
- zoj 3551
- ZOJ2925 DomiNo Grid(广搜)
- 线段树 + 矩阵 --- ZOJ 3772 Calculate the Function
- ZOJ--3710--Friends--二维数组模拟建立关系
- ZOJ3513 Human or Pig,博弈论
- zoj 1083 Frame Stacking
- ZOJ 3598 Spherical Triangle球面几何公式应用
- zoj 2112 树状数组 套主席树 动态求区间 第k个数