Triangular Sums (UVALive 3392, POJ 3086, ZOJ 2773, Regionals 2006 >> North America - Greater NY)

///     Raihan Ruhin
///     CSE, Jahangirnagar University.
///     Dhaka-Bangladesh.
///     id: raihanruhin (topcoder / codeforces / codechef / uva / uvalive), 3235 (lightoj)
///     mail: raihanruhin@ (yahoo / gmail / facebook)
///     blog: ruhinraihan.blogspot.com

#include<bits/stdc++.h>
using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define PI acos(-1.0)

#define MOD 1000000007
#define MX 100010

int w[305];
void precal()
{
    w[0]=0;
    int sum=1;
    for(int i=1;i<=300;i++)
    {
        sum+=(i+1);
        w[i]=w[i-1]+i*sum;
    }
return;
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int tc, kk=1, n, m, x, y, a, b, c;
    string s;
    precal();
    cin>>tc;
    while(tc--)
    {
        cin>>n;
        cout<< kk++ <<" "<<n<<" "<< w[n] <<"\n";
    }
return 0;
}