CodeForces 471C MUH and House of Cards

C. MUH and House of Cards
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Examples
input
13
output
1
input
6
output
0
Note
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.

找规律吧..反正我是没找出来…

//构成最高层时用的最少数量的card数目： n*(3n+1) / 2（因为每层数目为3n-1）

#include<stdio.h>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#include<functional>
#include<vector>
#include<iomanip>
#include<math.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<set>
#include<bitset>
using namespace std;
typedef long long ll;
int main()
{
    cin.sync_with_stdio(false);
    ll n;
    while (cin>>n)
    {
        ll Ans=0;
        for (ll i=1;; i++)
        {
            if (n<(3*i+1)*i/2) break;
            if ((n+i)%3==0) Ans++;
        }
        cout<<Ans<<endl;
    }
    return 0;
}