CodeForces 165B Burning Midnight Oil（二分水题）

最新推荐文章于 2018-05-14 16:03:16 发布

fly_tzf

最新推荐文章于 2018-05-14 16:03:16 发布

阅读量391

点赞数

分类专栏：二分

本文链接：https://blog.csdn.net/fly_tzf/article/details/70255592

版权

二分专栏收录该内容

1 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <algorithm>
#include <iostream>
#include<vector>
#include<cmath>
#include<set>
#include<cstring>
#include<map>
using namespace std;
const int maxn = 22222;
const int maxt = 100200;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double pi = acos(-1.0);
typedef long long ll;
int n, k;
bool ok(int m){
    ll sum = 0;
    while(m){
        sum += m;
        m /= k;
    }
    if(sum >= n) return true;
    return false;
}
int main(){
    scanf("%d%d", &n, &k);
    int l = 0, r = n, ans;
    while(l <= r){
        int m = (l + r) >> 1;
        if(ok(m)){
            ans = m;
            r = m - 1;
        }
        else l = m + 1;
    }
    printf("%d\n", ans);
    return 0;
}