Problem A. Vanya and Cubes

时间限制 2 ms   内存限制 256 MB

Vanya got n cubes. He decided to build a pyramid from them. Vanya wants to build the pyramid as follows: the top level of the pyramid must consist of 1 cube, the second level must consist of 1 + 2 = 3 cubes, the third level must have 1 + 2 + 3 = 6 cubes, and so on. Thus, the i-th level of the pyramid must have 1 + 2 + ... + (i - 1) + i cubes.

Vanya wants to know what is the maximum height of the pyramid that he can make using the given cubes.

输入数据

The first line contains integer n (1 ≤ n ≤ 104) — the number of cubes given to Vanya.

输出数据

Print the maximum possible height of the pyramid in the single line.

样例

样例说明

Illustration to the second sample:

636cca7c1dcf8ba78d3cd3f6175f507237b17a83.png

提交

请先 登录

© 2025 FAQs Contact About