24h購物| | PChome| 登入
2012-05-30 07:45:22| 人氣1,845| 回應0 | 上一篇 | 下一篇

[UVA] 12149 - Feynman

推薦 0 收藏 0 轉貼0 訂閱站台

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.

Sample input
2
1
8
0
Output for the sample input
5
1
204

ACM ICPC :: South American Regional 2008




#include <stdio.h>

int main() {
    int n;
    while(scanf("%d", &n) == 1 && n) {
        printf("%d\n", n*(n+1)*(2*n+1)/6);
    }
    return 0;
}

台長: Morris
人氣(1,845) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA][模擬] 118 - Mutant Flatworld Explorers
此分類上一篇:[UVA] 11063 - B2-Sequence

是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼:
請輸入圖片中算式的結果(可能為0) 
(有*為必填)
TOP
詳全文