Codeforces Round #491 (Div. 2)补题

C.Candies
https://codeforces.com/contest/991/problem/C
题意: 小王有m个糖果，每天只能吃k个，张三在他吃完后会吃掉剩下的10%(向下取整)，当k取多少时，小王吃的糖果数 >= 张三吃的，求k的最小取值。

思路：k的取值具有单调性，即k越大小王吃的糖果就越多。所以可以用二分。

#include<iostream>
#include <cstdio>
#include <map>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
typedef long long ll;

int t;
ll n;
void solve()
{
	return ;
}
bool valid(ll k) {
	ll m = n;
	ll c1 = 0, c2 = 0;
	while(m) {
		if(m <= k) {
			c1 += m;
			m = 0;
			break;
		}
		c1 += k;
		m -= k;
		c2 += m / 10;
		m -= m/10;
	}
	if(c1 >= c2) return true;
	else return false;
}
int main()
{
	ll l = 1, r = 1e18;
	cin >> n;
	while(l < r) {
		ll mid = l + r >> 1;
		if(!valid(mid)) l = mid + 1;
		else r = mid;
	}
	cout << r << endl;
//	print(r);
	return 0;
}