A9724 | Vanya and Cubes
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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<=10^{4}$ ) — the number of cubes given to Vanya.
输出格式
Print the maximum possible height of the pyramid in the single line.
输入输出样例
输入 #1
1
输出 #1
1
输入 #2
25
输出 #2
4
Illustration to the second sample:


C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted