Codeforces 165B Burning Midnight Oil 【二分】

题目链接：Codeforces 165B Burning Midnight Oil

B. Burning Midnight Oil
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
One day a highly important task was commissioned to Vasya — writing a program in a night. The program consists of n lines of code. Vasya is already exhausted, so he works like that: first he writes v lines of code, drinks a cup of tea, then he writes as much as lines, drinks another cup of tea, then he writes lines and so on: , , , …

The expression is regarded as the integral part from dividing number a by number b.

The moment the current value equals 0, Vasya immediately falls asleep and he wakes up only in the morning, when the program should already be finished.

Vasya is wondering, what minimum allowable value v can take to let him write not less than n lines of code before he falls asleep.

Input
The input consists of two integers n and k, separated by spaces — the size of the program in lines and the productivity reduction coefficient, 1 ≤ n ≤ 109, 2 ≤ k ≤ 10.

Output
Print the only integer — the minimum value of v that lets Vasya write the program in one night.

Examples
input
7 2
output
4
input
59 9
output
54
Note
In the first sample the answer is v = 4. Vasya writes the code in the following portions: first 4 lines, then 2, then 1, and then Vasya falls asleep. Thus, he manages to write 4 + 2 + 1 = 7 lines in a night and complete the task.

In the second sample the answer is v = 54. Vasya writes the code in the following portions: 54, 6. The total sum is 54 + 6 = 60, that’s even more than n = 59.

题意：有n的作业量，现在一个人第1次完成v的作业量，第二次完成v / k的作业量，第三次完成v / (k*k)的作业量，直到作业量为0停止。问你最小的v。

就是一个二分，脑残还WA一次。

AC代码：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 2*1e5 +10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void add(LL &x, LL y) { x += y; x %= MOD; }
bool judge(LL o, LL k, LL n) {LL ans = o;LL b = k;if(ans >= n) return true;while(o >= b) {ans += o / b;b = b * k;}return ans >= n;
}
int main()
{LL n, k;while(scanf("%lld%lld", &n, &k) != EOF) {LL l = 0, r = n, ans;while(r >= l) {LL mid = (l + r) >> 1;if(judge(mid, k, n)) {ans = mid;r = mid - 1;}else {l = mid + 1;}}printf("%lld\n", ans);}return 0;
}

Codeforces 165B Burning Midnight Oil 【二分】相关推荐

codeforces 165B（Burning Midnight Oil）
[题意描述] 本题就是给定代码任务为n行,起始代码书写能力为v行,然后每经过一次除以k,当v变为0时看是否完成代码任务n?并求出最小的v. [解题思路] 我们可以对v值进行二分,然后确定最后的v值. ...
Burning Midnight Oil
二分注意细节: n<k时 i会不会溢出 #include <stdio.h> #include <stdlib.h>int main() {int n,k,sum,i, ...
Educational Codeforces Round 64 -C（二分）
题目链接:https://codeforces.com/contest/1156/problem/C 题意:给出n个数和整形数z,定义一对数为差>=z的数,且每个数最多和一个数组成对,求最多有多 ...
Codeforces 484B Maximum Value(高效+二分)
题目链接:Codeforces 484B Maximum Value 题目大意:给定一个序列,找到连个数ai和aj,ai%aj尽量大,而且ai≥aj 解题思路:类似于素数筛选法的方式,每次枚举aj,然 ...
CodeForces - 645C Enduring Exodus（二分）
题目链接:http://codeforces.com/problemset/problem/645/C 题意:给你n个房间, 0代表空房子, 1代表非空的房子, 一个农夫和他的k个牛要住进空房子里面, ...
Codeforces 359D Pair of Numbers | 二分+ST表+gcd
题面: 给一个序列,求最长的合法区间,合法被定义为这个序列的gcd=区间最小值输出最长合法区间个数,r-l长度接下来输出每个合法区间的左端点题解: 由于区间gcd满足单调性,所以我们可以二分区间 ...
codeforces 706B B. Interesting drink(二分)
题目链接: B. Interesting drink 题意: 给出第i个商店的价钱为x[i],现在询问mi能在多少个地方买酒; 思路: sort后再二分; AC代码: #include <ios ...
CodeForces - 551C GukiZ hates Boxes(二分+贪心)
题目链接:点击查看题目大意:给出一个长度为 n 的数列 a,表示每个位置的障碍物数量,现在有 m 个学生可以来搬走障碍物,每一秒钟可以做出的行为如下: 从位置 i 移动到位置 i + 1 从当前位置 ...
CodeForces - 967D Resource Distribution(贪心+二分+构造)
题目链接:点击查看题目大意:给出 n 个机器,每个机器可以处理 a[ i ] 的工作,现在有两个工作需要处理,工作量分别为 x1 和 x2,可以将一个工作分配给 k 个机器同时完成,需要满足: k ...

Codeforces 165B Burning Midnight Oil 【二分】

Codeforces 165B Burning Midnight Oil 【二分】相关推荐

最新文章

热门文章