영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
(그림은 원문 저장소에서 볼 수 있습니다)
Nadja's cubes (cc by-sa Swedish Olympiad in Informatics 2018)
Nadja is gluing together small wooden cubes with a side length of 1 to form larger compact cubes. She has now decided that she wants one cube of each side length from 1 to N. How many small cubes does Nadja need?
Input
The input consists of a single integer N on the first and only line, 1 ≤ N ≤ 100.
Output
The program should output a single line containing an integer: the number of small cubes Nadja needs.
Scoring
| Group | Points | Constraints |
|---|---|---|
| 1 | 20 | N = 10 |
| 2 | 80 | No additional constraints. |
Explanation of Example
In example 1, Nadja wants one cube of each side length from 1 to 4. Thus, she needs 1^3 + 2^3 + 3^3 + 4^3 = 100 small cubes.
예제
예제 1
4
100
예제 2
7
784