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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
#include <math.h>
 int main(void){
    
    int N,i,s=0;
   scanf("%d",&N);
    int a[N],b[N],c[N-1];
  for(i=0;i<N;i++){
     if(i<N-1){
     scanf("%d %d %d",&a[i],&b[i],&c[i]); //N-1までのabcを求めた
     }
     else
       scanf("%d%d",&a[i],&b[i]); //このやり方だとできない
  }
   /*   scanf("%d",&a[i]);
   for(i=0;i<N;i++)
     scanf("%d",&b[i]);
   for(i=0;i<N-1;i++)
     scanf("%d",&c[i]);*/
   
   for(i=0;i<N;i++){
 /*    s+=b[a[i]-1];
     if(i>0){
       if(a[i]-a[i-1]==1){
         s+=c[a[i-1]-1];
       }
     }*/
   printf("%d %d %d\n",a[i],b[i],c[i]);     
     }
}