A. Vanya and Cubes
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
The first line contains integer n (1?≤?n?≤?104) ? the number of cubes given to Vanya.
Output
Print the maximum possible height of the pyramid in the single line.
Sample test(s)
input
output
input
25
output
Note
Illustration to the second sample:
没啥好说的。模拟一下就可以了，还wa一发不应该..
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <vector>#include <queue>#include <stack>#include <cassert>#include <algorithm>#include <cmath>#include <set>#include <limits>#include <map>using namespace std;#define MIN(a, b) ((a) (b) ? (a) : (b))#define F(i, n) for(int (i)=0;(i)=(t);--(i))#define REPOK(i, s, t, o) for(int (i)=(s);(i)::max();const double eps = 1e-10;const int INF = 0x7FFFFFFF;int main(){ int n; cin >> n; int ans = 0; int base = 1; while (n >= base) { ++ans; n -= base; base += ans+1; } cout <br> <br> <p></p> <br> </map></limits></set></cmath></algorithm></cassert></stack></queue></vector></cstring></cstdlib></cstdio></iostream>
