Akshay and his Vetri Kuri
All submissions for this problem are available.###Story: Akshay Venkat popularly known as panipuri8 is the inventor of the vetrikuri step used in the movie Boss Engira Bhaskaran. You don't believe it right? Check the following link Akshay the inventor of the legendary pose. To come up with that pose, Akshay had to solve a difficult problem. Can you solve the same problem ? ###Problem: You are given a positive integer $N$, you have to represent it as sum of distinct positive integers. What is the maximum number of distinct positive integers that you can use and still represent $N$. ###Input: - First and only line of input contains a single positive integer, $N$ ###Output: One positive integer, the maximum positive distinct integers that can be summed up to get the value $N$. ###Constraints - $1 \leq N \leq 1e18$ ###Sample Input: 5 ###Sample Output: 2 ###EXPLANATION: 5 can be represented as 1+4,2+3,3+2,4+1,5. So maximum integers that can be used in the representation is 2.
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions