hdu 4430 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,二分k

这个地方有个地方，我也弄不懂  为啥最后判断相等的时候会有一个加一的操作

 

#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

__int64 br,k,n;
__int64 sum;
__int64 temp;
__int64 t;
__int64 x,y;

__int64 getk()//二分一个k
{
    t=(__int64)pow(n*1.0,1.0/br);
    __int64 mid,left,right;
    left=2;
    right=t;
    while(left<=right)
    {
        mid=(left+right)>>1;
        __int64 ans=0;
        __int64 res=1;
        for(int i=1;i<=br;i++)
        {
            res*=mid;
            if(nbr*temp)
            {
                sum=br*temp;
                x=br;
                y=temp;
            }
            if(sum==br*temp)
            {
                if(x>br)
                {
                    x=br;
                    y=temp;
                }
            }
        }
        printf("%I64d %I64d\n",x,y);
    }
    return 0;
}