ashish_vaghani's blog

By ashish_vaghani, 2 years ago, In English

Given an integer $$$N$$$. Find two integers such that their product is strictly greater than $$$N$$$ and sum is minimum. How to solve this in O(1)?

P.S.- I posted this before, as I though contest ended at 9 pm. Sorry about that. JEEADVANCED can you confirm if the contest has ended.

Full text and comments »

  • Vote: I like it
  • -15
  • Vote: I do not like it