http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29592#problem/N
// File Name: bo_jwolf14.cpp
// Author: rudolf
// Created Time: 2013年08月20日 星期二 08:48:49
#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>
using namespace std;
int main()
{
long long n , s1 , s2 , s3 , v1 , v2 , v3 , s4 , s5 , s6 , temp ;
while( cin >> n )
{
s1 = s2 = s3 = 0 ;
temp = n * ( n + 1 ) / 2 ;
for( int i = 1 ; i <= n ; ++i )
{
s1 += i * i ;
s2 += i * i * i ;
s3 += i * i * i * i ;
}
s4 = temp * temp ;
s5 = temp * temp * temp ;
s6 = temp * temp * temp * temp ;
v1 = s4 - s1 ;
v2 = s5 - s2 ;
v3 = s6 - s3 ;
cout << s1 << " " << v1 << " " << s2 << " " << v2 << " " << s3 << " " << v3 << endl ;
}
return 0;
}