Competitive-Coding/collectingTheBalls.cpp at master · psdhanesh7/Competitive-Coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include<bits/stdc++.h>
using namespace std;

long long sharmasShare(long long n, long long k)
{
	long long remainingCandies = n;
	long long sharmasCandies;
	long long count = 0;

	while(remainingCandies > k)
	{
		remainingCandies = remainingCandies - k;
		remainingCandies = remainingCandies - (remainingCandies/10);
		count++;
	}

	sharmasCandies = k * count + remainingCandies;
	return sharmasCandies;
}

int main()
{
	long long n;
	cin >> n;

	long long maximum = n;
	long long minimum = 1;
	long long k = 1;
	long long ans;

	while(minimum <= maximum)
	{
		k = (minimum + maximum)/2;

		long long sharmasCandies = sharmasShare(n, k);

		if((sharmasCandies >= n/2 && n%2 == 0) || (sharmasCandies > n/2 && n%2 != 0))
		{
			ans = k;
			maximum = k-1;
		}
		else
		{
			minimum = k+1;
		}

	}

	cout << ans << endl;
	return 0;
}