CodeForces 471C

E - E
Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u
Submit Status Practice CodeForces 471C uDebug
Description
Input
Output
Sample Input
Sample Output
Hint
Description
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev decided to build a house of cards. For that they've already found a hefty deck of n playing cards. Let's describe the house they want to make:

The house consists of some non-zero number of floors.

Each floor consists of a non-zero number of rooms and the ceiling. A room is two cards that are leaned towards each other. The rooms are made in a row, each two adjoining rooms share a ceiling made by another card.

Each floor besides for the lowest one should contain less rooms than the floor below.

Please note that the house may end by the floor with more than one room, and in this case they also must be covered by the ceiling. Also, the number of rooms on the adjoining floors doesn't have to differ by one, the difference may be more.
While bears are practicing to put cards, Horace tries to figure out how many floors their house should consist of. The height of the house is the number of floors in it. It is possible that you can make a lot of different houses of different heights out of n cards. It seems that the elephant cannot solve this problem and he asks you to count the number of the distinct heights of the houses that they can make using exactly n cards.
Input
The single line contains integer n (1 ≤ n ≤ 1012) — the number of cards.
Output
Print the number of distinct heights that the houses made of exactly n cards can have.
Sample Input
Input

13

Output

1

Input

6

Output

0

Sample Output
Hint
In the first sample you can build only these two houses (remember, you must use all the cards):
Thus, 13 cards are enough only for two floor houses, so the answer is 1.
The six cards in the second sample are not enough to build any house.
 
분석: x방을 지으려면 3x-1장, h층을 지으려면 3(x1+x2+...+xh)-h장(x1+x2+...+xh>=1+2+...+h)이 필요하다. 그러면 층수를 매거하면 된다.
코드:
 

#include
#include
#include
#include
#include
using namespace std;

int main()
{
	long long n;
	cin >> n;
	long long result = 0;
	for (long long h = 1; h <= 10000000; ++h)
		if ((n + h) % 3 == 0 && (n + h) / 3 >= (1 + h)*h / 2)
			result++;
	cout << result << endl;
	return 0;
}