B - Problem B CodeForces - 492A

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.

Examples
Input
1
Output
1
Input
25
Output
4
Note
Illustration to the second sample:

问题分析：我是感觉把问题分析错了，弄得比较复杂。因为我设了很多数组还存储数据。
问题链接：https://vjudge.net/contest/276590#problem/B
代码：

#include<iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int b; int sum = 0, c[10000], sub = 0, num = 1;
	if (n == 1)
		cout << 1;

	for (int i = 0; i < n; i++)
	{
			b = 1 + i;
			
			sum +=b;
			c[i] = sum;
	}
	for (int j = 0; j< n; j++)
	{
		sub += c[j];
		num += 1;

		if ((n - sub) < 0)
		{
			cout << num-2; break;
		}
		else continue;
	}
}