B. Card Constructions（水）

outputstandard output A card pyramid of height 1 is constructed by
resting two cards against each other. For h>1, a card pyramid of
height h is constructed by placing a card pyramid of height h−1 onto a
base. A base consists of h pyramids of height 1, and h−1 cards on top.
For example, card pyramids of heights 1, 2, and 3 look as follows:

You start with n cards and build the tallest pyramid that you can. If
there are some cards remaining, you build the tallest pyramid possible
with the remaining cards. You repeat this process until it is
impossible to build another pyramid. In the end, how many pyramids
will you have constructed?

Input Each test consists of multiple test cases. The first line
contains a single integer t (1≤t≤1000) — the number of test cases.
Next t lines contain descriptions of test cases.

Each test case contains a single integer n (1≤n≤109) — the number of
cards.

It is guaranteed that the sum of n over all test cases does not exceed
109.

Output For each test case output a single integer — the number of
pyramids you will have constructed in the end.

Example inputCopy 5 3 14 15 24 1 outputCopy 1 2 1 3 0 Note In the
first test, you construct a pyramid of height 1 with 2 cards. There is
1 card remaining, which is not enough to build a pyramid.

In the second test, you build two pyramids, each of height 2, with no
cards remaining.

In the third test, you build one pyramid of height 3, with no cards
remaining.

In the fourth test, you build one pyramid of height 3 with 9 cards
remaining. Then you build a pyramid of height 2 with 2 cards
remaining. Then you build a final pyramid of height 1 with no cards
remaining.

In the fifth test, one card is not enough to build any pyramids.

根据题意提取数学公式，二分查找能形成的最大高度，然后取余，重复直到，小于最小高度1。

ll tn;
ll func(ll n)
{
    return (3*n*n+n)/2;
}
void solve()
{
    cin>>tn;
    ll times=0;
    while(tn>=2)
    {
        ll foke=0;
        ll l=1,r=100000;
        while(l<r)
        {
            ll mid=(l+r)>>1;
            ll f=func(mid);
            if(f<=tn)
            {
                l=mid+1;
                foke=f;
            }
            else
                r=mid;
        }
        times+=tn/foke;
        tn%=foke;
    }
    cout<<times<<endl;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}