Yukari's Birthday
Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2910 Accepted Submission(s): 610
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 i 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.
To make the birthday cake look more beautiful, Ran and Chen decide to place them like r ≥ 1 concentric circles. They place k i 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 12.
Each test consists of only an integer 18 ≤ n ≤ 10 12.
Output
For each test case, output r and k.
Sample Input
18 111 1111
Sample Output
1 17 2 10 3 10
17^1 + 1==18
10^1+10^2 + 1 == 111
10^1+10^2+103 + 1 == 1111
其中 +1 是可选的。
题目分折:
因为 K〉2 ,我们可以知道 R 的最大取值约为 45.所以我们可以 枚举 R的值。用二分查找 K 的值。
#include<cstdio>
#include<cstring>
#include<cmath>
typedef __int64 ll;
ll n;
ll bin(ll s){
ll low = 2,high = n,mid,i;
while(low<=high){
mid = (low+high)/2;
ll sum = 1,ans = 0;
for(i = 1;i<=s;i++){
if(n/sum<mid){
ans = n+1;
break;
}
sum *= mid;
ans += sum;
if(ans>n) break;
}
if(ans == n || ans == n-1) return mid;
else if(ans<n-1) low = mid + 1;
else high = mid - 1;
}
return -1;
}
int main(){
ll s,k,l,r,mid,i;
while(scanf("%I64d",&n)!=EOF){
l = 1;
r = n-1;
for(i = 2;i<=45;i++){
k = bin(i);
if(k != -1 && i*k<l*r){
l = i;
r = k;
}
}
printf("%I64d %I64d\n",l,r);
}
return 0;
}
伟大的梦想成就伟大的人,从细节做好,从点点滴滴做好,从认真做好。