HOJ 2412 Triangular Sums

http://acm.hit.edu.cn/hoj/problem/view?id=2412

#include <stdio.h>

int T(int x);

int main()
{
    int n, i, j, num, s;

    scanf("%d", &n);
    for (i = 1; i <= n; i++)
    {
        s = 0;
        scanf("%d", &num);
        for(j = 1; j <= num; j++)
            s += T(j);
        printf("%d %d %d\n", i, num, s);
    }

    return 0;
}

int T(int x)
{
    int s;
    s = (x * (x + 1) * (x + 2) ) / 2;
    return s;
}