Problem:
Score : 100 points

Problem Statement

Takahashi is going to set a 3-character password.

How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Constraints

1 \leq N \leq 9

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of possible passwords.

Sample Input 1

2

Sample Output 1

8

There are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.

Sample Input 2

1

Sample Output 2

1

There is only one possible password if you can only use one kind of character.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<cstdio>
using namespace std;
int main() {
	int n, ans = 0;
	scanf("%d", &n);
	if (n > 9)n = 9;
	ans += n;
	int k = n * (n - 1);
	if(k)ans += (k << 1) + k;
	k = 0;
	for (int i = 1; i < n-1; ++i) {
		for (int j = i + 1; j < n; ++j) 
			k += n - j;
	}
	if (k)ans += (k << 2) + (k<<1);
	printf("%d", ans);
}