HDU4430：Yukari's Birthday(二分)

Problem Description 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 kⁱ 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 ≤ 10¹².

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,k的值分別是多少，r*k相同時，輸出r最小的
思路： 首先用等比數列求和公式估測出r最大的值為40左右，那麼枚舉r，並對k進行二分匹配答案即可

#include 
#include 
#include 
#include 
using namespace std;
#define ll __int64

ll n;

ll bin(ll s)
{
    ll l = 2,r = n,mid,i;
    while(l<=r)
    {
        mid = (l+r)/2;
        ll sum = 1,ans = 0;;
        for(i = 1; i<=s; i++)
        {
            if(n/sumn)//放置溢出
                break;
        }
        if(ans == n || ans == n-1) return mid;
        else if(ans