http://acm.hdu.edu.cn/showproblem.php?pid=4803
贪心的策略是,每次尽量加价格,加到能满足条件的最大值,然后加一下数量,这样反复直到到达答案。
然后加到满足条件最大值一步不能模拟,可以推一下公式就能直接算出来了
代码:
#include <stdio.h>
#include <string.h>
const double eps = 1e-9;
double x, y;
int main() {
while (~scanf("%lf%lf", &x, &y)) {
if (x > y) {
printf("-1\n");
continue;
}
double s = (y + 1 - eps) / x;
double tmp = 1;
int count = (int)x - 1;
for (int i = 1; i <= (int)x; i++) {
int sb = (int)(s * i - tmp);
tmp += sb;
tmp = tmp / i * (i + 1);
count += sb;
}
printf("%d\n", count);
}
return 0;
}