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.
Each test consists of only an integer 18 ≤ n ≤ 10 12.
18 111 1111
1 17 2 10 3 10题意: 给出n,让n满足下列表达式:k^1+k^2+...+k^r=n(等于n-1也可以). 且r*k要最小,输出r和k,如果有多组条件满足,就输出r最小的一组。
因为k比较大,所以我们可以二分查找k,然后枚举r就可以解决问题了。
#include <stdio.h>
#include <string.h>
#define ll long long
ll n;
ll cal(int x, ll m) {
ll sum = 0, s = 1;
for(int i = 1; i <= x; i++) {
if(n/s < m) {
sum = n+1;
break;
}
sum += s*m;
s *= m;
if(sum > n) break;
}
return sum;
}
ll solve(int x) {
ll left = 2, right = n, mid;
while(left <= right) {
mid = left-(left-right)/2;
ll sum = cal(x, mid);
if(sum == n || sum == n-1)
return mid;
else if(sum < n-1) left = mid+1;
else right = mid-1;
}
return 0;
}
int main() {
while(~scanf("%lld", &n)) {
ll rl = 1, rr = n-1;
for(int i = 2; i <= 45; i++) {
ll s = solve(i);
if(s && i*s < rl*rr) {
rl = i;
rr = s;
}
}
printf("%lld %lld\n", rl, rr);
}
return 0;
}