How to approach this question? Link- https://codeforces.com/problemset/problem/1036/A

codeforces

Ishu061999
Shreyashkar lal
Ishu061999

Please Log in to answer

Note: Your answer should not be too short. Please wait a few seconds for the editor to load



Please make sure the answer is not too short

1 Answer

conan_0
conan_0 02:14, Dec 13
Anupam Singh

It is given there are 2n+1 points so there will be n odd points and maximum n triangles . In worst situation if the height is h for all n triangles, max area = n*(2*h)/2=nh (base length is 2) .  Given k should satisfy condition n(h-1)<k<=nh  =>  h-1<(k/n)<=h . h is basically ceiling value of k/n.

Here is the code,

#include<bits/stdc++.h>

using namespace std;

int main()
{
	ll n,k;
	cin>>n>>k;
	ll x=k/n;
	if(n*x==k)
	cout<<x;//equality condition k=nh
	else
	cout<<(x+1);//ceiling value
}

 




Please make sure the answer is not too short
0 Upvotes
Comments
No Comments yet