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 life-long 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
Petar Bosnjak:
2014-05-13 00:34:30
Just try to figure out solution , don't google for a formula that way u won't learn anything! |
|
mockingjay:
2014-03-18 09:28:33
got 1 WA due selecting c bt i solved in c++ .........very easy dp.
|
|
Piyush Nirmal:
2014-02-19 17:48:00
credit: Parshant garg |
|
square root of one..........:
2014-02-03 23:10:45
[spoiler removed] Last edit: 2014-02-04 00:59:11 |
|
nishanth:
2014-02-02 12:48:24
getting wa please check the code
|
|
PC HC:
2014-01-28 09:36:46
why can't this question be solved in python3? |
|
dpdrmj:
2013-12-25 15:59:11
First solution to be AC in one go :) |
|
Pranav Nair:
2013-12-22 12:32:11
got 2 WA just for not printing output in new line :( |
|
Praneeth :
2013-12-22 07:18:31
easy one standard puzzle and by seeing input 8 .i got an idea and AC in first go:) |
|
Mitch Schwartz:
2013-12-01 08:16:07
It can be solved from first principles by actually thinking about the problem (what a concept!), and you don't need that formula that people keep talking about. I've censored some spoiling comments. |
Added by: | Diego Satoba |
Date: | 2008-11-23 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | ASM64 C C++ 4.3.2 CPP FORTRAN JAVA PAS-GPC PAS-FPC |
Resource: | South American Regional Contests 2008 |