SAMER08F  Feynman
Richard Phillips Feynman was a well known American physicist and a recipient of the Nobel Prize in Physics. He worked in theoretical physics and also pioneered the field of quantum computing. He visited South America for ten months, giving lectures and enjoying life in the tropics. He is also known for his books "Surely You're Joking, Mr. Feynman!" and "What Do You Care What Other People Think?", which include some of his adventures below the equator.
His lifelong addiction was solving and making puzzles, locks, and cyphers. Recently, an old farmer in South America, who was a host to the young physicist in 1949, found some papers and notes that is believed to have belonged to Feynman. Among notes about mesons and electromagnetism, there was a napkin where he wrote a simple puzzle: "how many different squares are there in a grid of N ×N squares?".
In the same napkin there was a drawing which is reproduced below, showing that, for N=2, the answer is 5.
Input
The input contains several test cases. Each test case is composed of a single line, containing only one integer N, representing the number of squares in each side of the grid (1 ≤ N ≤ 100).
The end of input is indicated by a line containing only one zero.
Output
For each test case in the input, your program must print a single line, containing the number of different squares for the corresponding input.
Example
Input: 2 1 8 0 Output: 5 1 204
hide comments
KD :
20150208 11:08:54
AC! in first attempt......very easy prob.


Devendra Sharma:
20150207 14:10:57
well i used formula n*(n+1)*(2*n+1)/6 and it's a wrong answer why??


beginner:
20150126 11:00:29
Last edit: 20150413 06:35:29 

Maverick:
20150111 23:59:38
Lmao good Logic .. 

Shubham:
20150106 20:45:29
My code runs well on ideone but it comes as compilation error on judge :(


Guruprasad Zapate:
20141221 13:10:53
what should be the output of 0 square?


:.Mohib.::
20141220 11:05:35
Easy one...AC in first go...:) 

Prashant Kumar Sharma:
20141214 14:43:41
yeah ! AC in first go .. only 3 lines required :) Last edit: 20141214 14:44:28 

Malfple:
20141210 02:25:48
If you are pretty good at squares, you can realize it in under 2 minutes. Simplest code for a hardlooking problems. 

Dhruv k14:
20141123 20:47:34
AC in the first go.

Added by:  Diego Satoba 
Date:  20081123 
Time limit:  0.165s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  ASM64 C C++ 4.3.2 CPP FORTRAN JAVA PASGPC PASFPC 
Resource:  South American Regional Contests 2008 