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: Wrong Answer)

// Contest.cpp : アプリケーションのエントリ ポイントを定義します。
//

#include"iostream"
#include"string"
#include"vector"
#include"algorithm"

using namespace std;

int main()
{
	/*int n,k;
	cin >> n;
	vector<char>s(n);
	for (int j = 0; j < n; j++)  cin >> s[j];
	cin >> k;
	for (int i = 0; i < n; i++)
	{
		if (s[i] != s[k-1]) {
			s[i] = '*';
		}
	}

	for (int l = 0; l < n; l++)
	{
		cout << s[l] ;
	}*/

	int n;
	cin >> n;
	vector<int>d(n);
	vector<int>e(n);
	vector<int>f(n-1);
	for (int i = 0; i < n; i++) cin >> d[i];
	for (int i = 0; i < n; i++) cin >> e[i];
	for (int i = 0; i < n-1; i++) cin >> f[i];
	
	int sum = 0;

	for (int i = 0; i < n;i++) {

		sum = sum + e[i];

	}

	for (int i = 0; i < n-1; i++) {
		if (d[i] + 1 == d[i + 1]) {
			sum = sum + f[d[i]-1];
		}
	}

	cout << sum;
}