< Back to forum

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


Asked by: Shreyashkar_lal on April 7, 2019, 6:34 p.m. Last updated on April 7, 2019, 6:34 p.m.

Enter your answer details below:


Enter your comment details below:


1 Answer(s)


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,


using namespace std;

int main()
	ll n,k;
	ll x=k/n;
	cout<<x;//equality condition k=nh
	cout<<(x+1);//ceiling value


Anupam_Singh last updated on April 7, 2019, 6:34 p.m. 0    Reply    Upvote   

Instruction to write good question
  1. 1. Write a title that summarizes the specific problem
  2. 2. Pretend you're talking to a busy colleague
  3. 3. Spelling, grammar and punctuation are important!

Bad: C# Math Confusion
Good: Why does using float instead of int give me different results when all of my inputs are integers?
Bad: [php] session doubt
Good: How can I redirect users to different pages based on session data in PHP?
Bad: android if else problems
Good: Why does str == "value" evaluate to false when str is set to "value"?

Refer to Stack Overflow guide on asking a good question.