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>

int bonuse(int *a, int *c){
    int tmp = 0;
    do{
        if(*(a + 1) - *a == 1){
            tmp += c[*a - 1];
        }
    }while(*a++);

    return tmp;
}

int sumb(int *b){
    int tmp = 0;
    int i;

    do{
        tmp += *b;
    }while(*b++);

    return tmp;
}

int main(void){
    int n;
    int a[20] = {0};
    int b[20] = {0};
    int c[19] = {0};
    int i;

    scanf("%d", &n);
    for(i = 0; i < n; 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]);
    }

    printf("%d\n", sumb(b) + bonuse(a, c));

    return 0;
}