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.



Sample input:
2


Sample output:
8

Submission status: Wrong Answer

Solution code:
N = int(input())
print (N**2)

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n ** n)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(n*(n-1)*(n-2))

Submission status: Wrong Answer

Solution code:
N = int(input())
print(N ** 2)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(2**n)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(2**n)

Submission status: Wrong Answer

Solution code:
N = int()
print(N**3)

Submission status: Wrong Answer

Solution code:
n = int(input())
n ** 3

Submission status: Wrong Answer

Solution code:
N = int(input())
print(3**N)

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 9)

# map(int, sys.stdin.read().split())


def input():
    return sys.stdin.readline().rstrip()


def main():
    N = int(input())
    print(N*3)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = input()
i=0
if int(N)<9:
  i = int(N)*int(N)*int(N)
  print(i)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N**2)

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())

if N == 1:
  print(1)
  sys.exit()
elif N == 2:
  print(2)
  sys.exit()
else:
  print(N*(N-1)*(N-2))
  sys.exit()

Submission status: Wrong Answer

Solution code:
import  math
num = int(input())
print(math.factorial(num))

Submission status: Wrong Answer

Solution code:
N = int(input())

print(2**N)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(n**2)

Submission status: Wrong Answer

Solution code:
a=int(input())
print(a+a*3)

Submission status: Wrong Answer

Solution code:
n=int(input())
import math
x=math.pow(n,3)
print(x)

Submission status: Wrong Answer

Solution code:
n=int(input())
import math
print(math.pow(n,3))

Submission status: Wrong Answer

Solution code:
n=int(input())
import math
print (math.pow(n,3))

Submission status: Wrong Answer

Solution code:
n = int(input())
print(n**n)

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

from operator import itemgetter
from bisect import bisect,insort

def solve(n, ppp):
    q = sorted(enumerate(ppp),key=itemgetter(1),reverse=True)
    le = [-1,-1,n-1,n,n]
    ans = 0
    for i, p in q[1:]:
        l_i = bisect(le,i)
        LL = le[l_i-2]
        LR = le[l_i-1]
        RL = le[l_i]
        RR = le[l_i+1]
        ans += p*((LR-LL)*(RL-i)+(RR-RL)*(i-LR))
        insort(le,i)
    return ans


n = int(readline())
ppp = list(map(int,readline().split()))
print(solve(n, ppp))

Submission status: Wrong Answer

Solution code:
print(int(input())**2)

Submission status: Wrong Answer

Solution code:
import operator as op
from functools import reduce

def ncr(n, r):
    r = min(r, n-r)
    numer = reduce(op.mul, range(n, n-r, -1), 1)
    denom = reduce(op.mul, range(1, r+1), 1)
    return numer / denom

N = int(input())
print(int(ncr(N,3)))

Submission status: Wrong Answer

Solution code:
from itertools import combinations

# input
N = int(input())
print(len(list(combinations([i for i in range(1, N + 1)] * 3, 3))))

Submission status: Wrong Answer

Solution code:

result = 0

for i in range(1, 10):
    for j in range(1, 10):
        for k in range(1, 10):
            result += 1


print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(n*3)

Submission status: Wrong Answer

Solution code:
print(3**int(input()))

Submission status: Wrong Answer

Solution code:
import itertools
import math
##print(ord("A"))
n = int(input())
#n,k,q = map(int,input().split())
#h = list(map(int,input().split()))	
def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)
if n==2:
    print("8")
elif n==1:
    print("1")

else:
    sum = 9
    for i in range(3,n):
        sum+=permutations_count(i,3)
    print(sum)
# 12

Submission status: Wrong Answer

Solution code:
import itertools
import math
##print(ord("A"))
n = int(input())
#n,k,q = map(int,input().split())
#h = list(map(int,input().split()))	
def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)
if n==2:
    print("8")
elif n==1:
    print("1")

else:
    print(permutations_count(n,3))
# 12

Submission status: Wrong Answer

Solution code:
n=int(input())

print(2**n)

Submission status: Wrong Answer

Solution code:
N = int(input())
print(N**N*N)

Submission status: Wrong Answer

Solution code:
N = int(input())
print(N^3)

Submission status: Wrong Answer

Solution code:
print(2**int(input()))

Submission status: Wrong Answer

Solution code:
s=int(input())
print(s^3)

Submission status: Wrong Answer

Solution code:
from sys import stdin

A = int(stdin.readline().rstrip())

print(A ** A)

Submission status: Wrong Answer

Solution code:
print(3 ** int(input()))

Submission status: Wrong Answer

Solution code:
N = int(input())
print(N**N)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = N**3

Submission status: Wrong Answer

Solution code:
n=int(input())
m=n**n
print(m)

Submission status: Wrong Answer

Solution code:
n=int(input())
m=n*n
print(m)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(3**n)

Submission status: Wrong Answer

Solution code:
n =int(input())
print(n ** n)

Submission status: Wrong Answer

Solution code:
print(int(input())*3)

Submission status: Wrong Answer

Solution code:
n = int(input())

print (n^3)

Submission status: Wrong Answer

Solution code:
N=int(input())
print(3**N)

Submission status: Wrong Answer

Solution code:
N=int(input())
print(2**N)

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n ** n)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(n ^ 3)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 2 ** ((N - 1) * 3)

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in range(1,N+1):
    for j in range (1, N+1):
        for k in range (1, N+1):
            print(str(i)+str(j)+str(k))

Submission status: Wrong Answer

Solution code:
print(int(input()) ** 2)

Submission status: Wrong Answer

Solution code:
N=int(input())

print(N^3)

Submission status: Wrong Answer

Solution code:
N=int(input())

print(2^N)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = 2 ** N
print(a)

Submission status: Wrong Answer

Solution code:
n = int(input())

if n == 1:
    print('使える文字が 1種類しか無い場合、パスワードは1種類しか設定出来ません。')
else:
    msg = "設定出来るパスワードは"
    array = []
    for x in range(1, n + 1) :
        for y in range(1, n + 1):
            for z in range(1, n + 1):
                array.append("\'" + str(x) + str(y) + str(z) + "\'")
    
    print("設定出来るパスワードは" + ','.join([str(i) for i in array]) + 'の' + str(n ** 3) + '種類です。')

Submission status: Wrong Answer

Solution code:
var = int(input())

pas = var ** var

print(pas)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

a = 9*9*9
# 出力
print(a)

Submission status: Wrong Answer

Solution code:
n=int(input())
if 1<=n<=9:
  print("n**3")

Submission status: Wrong Answer

Solution code:
print((int(input()) -1) ** 3)

Submission status: Wrong Answer

Solution code:
print((int(input())**2)**2)

Submission status: Wrong Answer

Solution code:
import math
N = int(input())

print(math.factorial(N)**3)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(n**n)

Submission status: Wrong Answer

Solution code:
a = int(input())
a ** 3

Submission status: Wrong Answer

Solution code:
N=1
print(N**3)

Submission status: Wrong Answer

Solution code:
x=3
print(x**3)

Submission status: Wrong Answer

Solution code:
x=3
x=x**3

Submission status: Wrong Answer

Solution code:
n = input()
print 2 ** n

Submission status: Wrong Answer

Solution code:
N=int(input())
print(N**2)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 2 * 2 * 2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
print(3*N)

Submission status: Wrong Answer

Solution code:
a=int(input())
re=1
if(a==1):
  print(1)
else:  
  for i in range(a+1):
    re=re*a
  print(re)

Submission status: Wrong Answer

Solution code:
a=int(input())
re=1
for i in range(a+1):
  re=re*a
print(re)

Submission status: Wrong Answer

Solution code:
N=int(input())
a=1
b=1
for i in range(1,N+1):
  a = a*(N+1-i)
  b = b*i
print(a//b)

Submission status: Wrong Answer

Solution code:
N = int(input())
result = (N-1)**3
print(result)

Submission status: Wrong Answer

Solution code:
n=int(input("Enter a no"))
x=n*n*n
print(x)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N^3)

Submission status: Wrong Answer

Solution code:
N = int(input())
print(2**N)

Submission status: Wrong Answer

Solution code:
def solution(N):
  return N ** 3

Submission status: Wrong Answer

Solution code:
N=int(input())
print(N^3)

Submission status: Wrong Answer

Solution code:
N=int(input())
ans = N^3
print(ans)

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc139/tasks/abc139_d
# -*- coding: utf-8 -*-

pass_clm = int(input())
print((pass_clm - 1) ** 3)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(2**n)

Submission status: Wrong Answer

Solution code:
S = int(input())
print(S ^ 3)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
n = int(input())
print((n ** 3) * (n ** 2) * n)

Submission status: Wrong Answer

Solution code:
N = input()
N = int(N)

ans = 3 ** N
if N == 1:
    ans = 1
print(ans)

Submission status: Wrong Answer

Solution code:
from math import pow

n = int(input())

print(pow(n, 3))

Submission status: Wrong Answer

Solution code:
n=int(input())
print(n*n)

Submission status: Wrong Answer

Solution code:
n = int(input())
result = 1
while n >= 1:
    result *= n
    n -= 1
print(result)

Submission status: Wrong Answer

Solution code:
N = input()
password = N*3
print(password)

Submission status: Wrong Answer

Solution code:
import random as np
N = range(1,10)
number_1 = np.choice(N)
password = number_1**3
print(password)

Submission status: Wrong Answer

Solution code:
n = int(input())

res = 1
for i in range(n):
    res = res*n
print(res)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    ans = N**3 + N**2 + N
    print(ans)
    
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
N = int(input().strip())


def facto(n):
    result = 1
    for i in range(1, n+1):
        result *= i
    return result


print(facto(N)**3)

Submission status: Wrong Answer

Solution code:
n = int(input())
password = n^3
print(password)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(n^3)

Submission status: Wrong Answer

Solution code:
n=int(input())
n=n**n
print(n)

Submission status: Wrong Answer

Solution code:
N=int(input())
N**3

Submission status: Wrong Answer

Solution code:
N=int(input())
N*N*N

Submission status: Wrong Answer

Solution code:
n=int(input())
print(3**n)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(3*n)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(9*n)

Submission status: Wrong Answer

Solution code:
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix
 
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！
 
def main():
    n=int(input())
    print(3**n)
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a = int(input())

b = pow(2,a);
print(b)

Submission status: Wrong Answer

Solution code:
i = int(input())
print(2**3)

Submission status: Wrong Answer

Solution code:
N = int(input())
print(N*3)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys  # {{{
import os
import time
import re
from pydoc import help
import string
import math
from operator import itemgetter
from collections import Counter
from collections import deque
from collections import defaultdict as dd
import fractions
from heapq import heappop, heappush, heapify
import array
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy as dcopy
import itertools
# }}}

# pre-defined{{{
sys.setrecursionlimit(10**7)
INF = 10**20
GOSA = 1.0 / 10**10
MOD = 10**9+7
ALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def DP(N, M, first): return [[first] * M for n in range(N)]
def DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]
from inspect import currentframe
# }}}

def local_input():# {{{
    from pcm.utils import set_stdin
    import sys
    from pathlib import Path
    parentdir = Path(os.path.dirname(__file__)).parent
    inputfile = parentdir.joinpath('test/sample-1.in')
    if len(sys.argv) == 1:
        set_stdin(inputfile)
# }}}

def solve():
    return 0

if __name__ == "__main__":# {{{
    try:
        local_input()
        def dump(*args):
            names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
            print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)
    except:
        def dump(*args):
            pass

    solve()

# vim: set foldmethod=marker:}}}

Submission status: Wrong Answer

Solution code:
import math
i=input()
p=math.factorial(i) * i
print(p)

Submission status: Wrong Answer

Solution code:
import math
i=input()
p=math.factorial(i)
print(p)

Submission status: Wrong Answer

Solution code:
N=input('>>')
N=int(N)
ans=N*N*N
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input('N'))
combination=n*n*n
print(combination)

Submission status: Wrong Answer

Solution code:
n=int(input('N'))
combination=n*n*n
print(n)

Submission status: Wrong Answer

Solution code:
integer = int(input('N'))
times = integer * integer * integer
print(times)

Submission status: Wrong Answer

Solution code:
integer = int(input('N'))
print(integer ** 3)

Submission status: Wrong Answer

Solution code:
num = int(input())
if num == 1: 
  print(1)
print(num ** 3)

Submission status: Wrong Answer

Solution code:
N=int(input("N="))
r=N**3
print(r)

Submission status: Wrong Answer

Solution code:
n = int(input())
password = n**2
print(password)

Submission status: Wrong Answer

Solution code:
inp = int(input(">"))
print(inp ** 3)

Submission status: Wrong Answer

Solution code:
inp = int(input(">"))
print(inp ** 3)

Submission status: Wrong Answer

Solution code:
N=int(input())
print(3**N if N>1 else 1)

Submission status: Wrong Answer

Solution code:
N=int(input())
print(3**N if N>2 else 1)

Submission status: Wrong Answer

Solution code:
N = 0
print(N**3)

Submission status: Wrong Answer

Solution code:
N=int(input())
passward=110
iteration=0
for l in range(N):
    for m in range(N):
        for n in range(N):
            passward+=1
            iteration+=1
            print(passward)
        passward-=N
        passward+=10
    passward-=10*N
    passward+=100
print(iteration)

Submission status: Wrong Answer

Solution code:
N=int(input())
passward=110
iteration=0

for l in range(N):
    for m in range(N):
        for n in range(N):
            passward+=1
            iteration+=1
            print(passward)
        passward-=N
        passward+=10
    passward-=10*N
    passward+=100

print(iteration)

Submission status: Wrong Answer

Solution code:
N=int(input())

passward=110
iteration=0

for l in range(N):
    for m in range(N):
        for n in range(N):
            passward+=1
            iteration+=1
            print(passward)
        passward-=N
        passward+=10
    passward-=10*N
    passward+=100

print(iteration)

Submission status: Wrong Answer

Solution code:
print("Nの値を入力して下さい。")
N=int(input())

while N<=0 or N>9:
    print("Nが指定の範囲外の値です。\n再入力して下さい。")
    N=int(input())

passward=110
iteration=0

for l in range(N):
    for m in range(N):
        for n in range(N):
            passward+=1
            iteration+=1
            print(passward)
        passward-=N
        passward+=10
    passward-=10*N
    passward+=100

print(iteration)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(n^3)

Submission status: Wrong Answer

Solution code:
print(int(input())^3)

Submission status: Wrong Answer

Solution code:
a=int()
a=(a*a*a)
print(str(a))

Submission status: Wrong Answer

Solution code:
a=int()
print(str(a*a*a))

Submission status: Wrong Answer

Solution code:
N=int(input())
print(2**N)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=1
for i in range(n-1):
  ans*=2
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=1
for i in range(n-1):
  ans*=3
print(ans)

Submission status: Wrong Answer

Solution code:
input_int = int(input())
# print(input_int_list)
# print(input_int_list[1])
# print(input_int_list[2])

ans = 0

n = input_int
for number1 in range(1,n):
	for number2 in range(1,n):
		for number3 in range(1,n):
			ans += 1



		

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input("Number between 1 and 9"))
print(str(n*n*n))

Submission status: Wrong Answer

Solution code:
import itertools

n = int(input("Input N"))
x = []
for i in range(0, n):
  x.append(i)
print(str(itertools.permutations(x)))

Submission status: Wrong Answer

Solution code:
N=int(input())
Num=N*N*N
print(N)

Submission status: Wrong Answer

Solution code:
print 3**int(raw_input())

Submission status: Wrong Answer

Solution code:
num = int(input()) + 1
manzokudo = 0
for i in range(1, num):
    manzokudo += i + 1

print(manzokudo)

Submission status: Wrong Answer

Solution code:
x = int(input())
print(x^3)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(9**N)

Submission status: Wrong Answer

Solution code:
N = int(input())
print(N**3 if N > 2 else 1)

Submission status: Wrong Answer

Solution code:
n=int(input())

if n == 1:
  print(1)
else:
  print(n**n)

Submission status: Wrong Answer

Solution code:
n=int(input())

print(n**n**n)

Submission status: Wrong Answer

Solution code:
n=int(input())
k=n^3
print(k)

Submission status: Wrong Answer

Solution code:
print("(input())**3")

Submission status: Wrong Answer

Solution code:
N=int(input())
if 1<=N<=9:
   print("N**3")
else:
  print("Error")

Submission status: Wrong Answer

Solution code:
n=int(input())
print("n**3")

Submission status: Wrong Answer

Solution code:
N=input()
print("N**3")

Submission status: Wrong Answer

Solution code:
N=int(input())
print("N**3")

Submission status: Wrong Answer

Solution code:
n=int(input("Number"))
print(n**3)

Submission status: Wrong Answer

Solution code:
n=int(input("Number"))
if n<=9:
    print(n**3)

Submission status: Wrong Answer

Solution code:
a=input("the number you can")
if type(a)==int:
  if a<=9:
    print(a**3)

Submission status: Wrong Answer

Solution code:
n = int(input("N>> "))
print(n**3)

Submission status: Wrong Answer

Solution code:
n=int(input())
answer=n**3

Submission status: Wrong Answer

Solution code:
int(input())*3

Submission status: Wrong Answer

Solution code:
n=int(input())

Submission status: Wrong Answer

Solution code:
n=int(input())
if n == 1:
    print(1)
else:
    print(3**n-1)

Submission status: Wrong Answer

Solution code:
N=int(input())
x=N^3
print(x)

Submission status: Wrong Answer

Solution code:
N = input()
ans = int(N)*int(N)*int(N)

Submission status: Wrong Answer

Solution code:
a = int(input())
s = pow(a,a-1)
print(pow(s,3))

Submission status: Wrong Answer

Solution code:
a = int(input())
s = pow(8,a-1)
print(s)

Submission status: Wrong Answer

Solution code:
a = int(input())
print((a-1)**3)

Submission status: Wrong Answer

Solution code:
n = int(input())
s = 0
for i in range(n+1):
  for j in range(n+1):
    for m in range(n+1):
      s += 1

print(s)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(n**2)

Submission status: Wrong Answer

Solution code:
N=int(input())
if N==1:
  print(1)
else:
  print(N*(N-1)*(N-2))

Submission status: Wrong Answer

Solution code:
N=int(input())
N*(N-1)*(N-2)

Submission status: Wrong Answer

Solution code:
N = int(input(""))

if N == 1:
    print("1")
if N >= 2 and N <= 9:
    w = N * (N + 2)
    print(w)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
n = 0
for i in range(0, 1000):
  n += 1
# 出力
print("{}".format(n))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
N = int(input())
c = 0
 
print(N*3)

Submission status: Wrong Answer

Solution code:
N=int(input())
print(N*(N-1)*(N-2))

Submission status: Wrong Answer

Solution code:
#code
n  = int(input())

print(2**n)

Submission status: Wrong Answer

Solution code:
CHARACTERS = 3
def numberOfPossiblePasswords(N):
    if N >= 1  and N <= 9: return pow(N, CHARACTERS)
    else: return 0

Submission status: Wrong Answer

Solution code:
# -*- coding: UTF-8 -*-

import math

n = int (input())
print(math.factorial(n))

Submission status: Wrong Answer

Solution code:
N=5
print(N*(N-1)*(N-2))

Submission status: Wrong Answer

Solution code:
N = input()
if type(N) == int and N >= 1 and N <= 9:
  print(N**3)

Submission status: Wrong Answer

Solution code:
n = int(input().strip())

print(n^3)

Submission status: Wrong Answer

Solution code:
def check(N):
    if type(N) == int and N >= 1 and N <= 9:
        print(N**3)       
check(input())

Submission status: Wrong Answer

Solution code:
def check(N):
    if type(N) == int and N >= 1 and N <= 9:
        print(N**3)       
check(2)
check(1)

Submission status: Wrong Answer

Solution code:
from operator import mul
from functools import reduce

def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom

print(combinations_count(3, 5))

Submission status: Wrong Answer

Solution code:
def check(N):
    if type(N) == int and N >= 0 and N <= 9:
        return(N**3)

Submission status: Wrong Answer

Solution code:
def check(N):
    if type(N) == int and N >= 0 and N <= 9:
        return(N**3)
        
check(2)
check(1)

Submission status: Wrong Answer

Solution code:
N=int(input())

print(N**2)

Submission status: Wrong Answer

Solution code:
N=int(input())
for i in range(2):
  N*(N-1)
  N-=1

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
cnt = 0
if a == 1:
  cnt = 0
elif a > 9:
  cnt = 0
elif a < 1:
  cnt = 0
else:
  for x in range(a):
    for y in range(a):
      for z in range(a):
        cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
def check(N):
    if type(N) == int and N >= 1 and N <= 9:
        print(N**3)
        
check(2)
check(1)

Submission status: Wrong Answer

Solution code:
def check(N):
    if type(N) == int and N >= 0 and N <= 9:
        print(N**3)
        
check(2)
check(1)

Submission status: Wrong Answer

Solution code:
N=int(input())
a=N*(N-1)*(N-2)
print(a)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
cnt = 0
if a == 1:
  cnt = 0
elif a > 9:
  cnt = 0
else:
  for x in range(a):
    for y in range(a):
      for z in range(a):
        cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
k = int(input())
print(k**k)

Submission status: Wrong Answer

Solution code:
N = int(input())
cnt = 0
cnt += N
for i in range(1, N+1):
  for j in range(N+1):
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n * (n - 1) * (n - 2))

Submission status: Wrong Answer

Solution code:
n = int(input())

ans =  (n-1)**3

Submission status: Wrong Answer

Solution code:
a=int(input())
print(a**2)

Submission status: Wrong Answer

Solution code:
def cal_password_nums(N):
    pw_dict = {}
    for a in range(N):
        for b in range(N):
            for c in range(N):
                tmp_pw = str(a) + str(b) + str(c)
                if not tmp_pw in pw_dict:
                    pw_dict[tmp_pw] = 1
    return len(pw_dict)

Submission status: Wrong Answer

Solution code:
f = [1 for i in range(10)]
for i in range(1,10):
    f[i] = f[i-1] * i
# print(f)
n = int(input())
ans = f[n] * f[n] * f[n]
print(ans)

Submission status: Wrong Answer

Solution code:
a=int(input())
print("a*3")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
cnt = 0
if a == 1:
  cnt = 0
else:
  for x in range(a):
    for y in range(a):
      for z in range(a):
        cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
a=int(input())
print('a*3')

Submission status: Wrong Answer

Solution code:
n = int(input())
answer = n * n * n
print(n)

Submission status: Wrong Answer

Solution code:
n = int(input())
pow(n,3)
print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = N
for i in range(N):
    ans = ans * N
print ( ans )

Submission status: Wrong Answer

Solution code:
x=int(input())
ans=0
if x == 1:
    ans=1
elif x == 2:
    ans=2
else:
    ans=x*(x-1)*(x-2)
print(ans)

Submission status: Wrong Answer

Solution code:
print(2**(int(input())+1))

Submission status: Wrong Answer

Solution code:
n = int(input())
answer = n^3
print(answer)

Submission status: Wrong Answer

Solution code:
k = int(input())
print(2**k)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(2**3)

Submission status: Wrong Answer

Solution code:
import math
print (int(math.pow(2, int(input())-1)))

Submission status: Wrong Answer

Solution code:
from itertools import accumulate
import sys

def main():
    input = sys.stdin.readline
    N = int(input())
    print(2**N)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n^3)

Submission status: Wrong Answer

Solution code:
print(int(input())^3)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(3 ** n)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(2**3)

Submission status: Wrong Answer

Solution code:
print(9**3)

Submission status: Wrong Answer

Solution code:
N=int(input())
print(N*N)

Submission status: Wrong Answer

Solution code:
import sys

n=int(sys.stdin.readline())
print( n*3 )

Submission status: Wrong Answer

Solution code:
print(1<<int(input()))

Submission status: Wrong Answer

Solution code:
n = int(input())
print(2 ** n)

Submission status: Wrong Answer

Solution code:
#A
N = int(input())
print(N^3)

Submission status: Wrong Answer

Solution code:
print((int(input()))*3)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(2**(N+1))

Submission status: Time Limit Exceeded

Solution code:
import time
time.sleep(19)

Submission status: Accepted

Solution code:
print(int(input())**3)

Submission status: Accepted

Solution code:
n = int(input())
print(n**3)

Submission status: Accepted

Solution code:
N = int(input())
print(N ** 3)

Submission status: Accepted

Solution code:
N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
n = int(input())

print(n * n * n)

Submission status: Accepted

Solution code:
n = int(input())
print(n ** 3)

Submission status: Accepted

Solution code:
N = int(input())
print(N**3)

Submission status: Accepted

Solution code:
n = int(input())
print(n ** 3)

Submission status: Accepted

Solution code:
n = int(input())
print(n * n * n)

Submission status: Accepted

Solution code:
n=int(input())

print(n**3)

Submission status: Accepted

Solution code:
n=int(input())
print(n**3)

Submission status: Accepted

Solution code:
N = int(input())
ans = N**3
print(ans)

Submission status: Accepted

Solution code:
print(int(input())**3)

Submission status: Accepted

Solution code:
n = int(input())

print(n**3)

Submission status: Accepted

Solution code:
N = int(input())
print (N**3)

Submission status: Accepted

Solution code:
n = int(input())
print(n**3)

Submission status: Accepted

Solution code:
N = int(input())
print(N*N*N)

Submission status: Accepted

Solution code:
N=int(input())

print(N**3)

Submission status: Accepted

Solution code:
N=int(input())
print(N*N*N)

Submission status: Accepted

Solution code:
x = int(input())
print(x**3)

Submission status: Accepted

Solution code:
def resolve():
    n = int(input())
    print(n**3)
resolve()

Submission status: Accepted

Solution code:
n=int(input())

print(n**3)

Submission status: Accepted

Solution code:
#from collections import deque
#from heapq import heapify, heappop, heappush
#from bisect import insort
#from math import gcd
#from decimal import Decimal
#mod = 1000000007
#mod = 998244353
N = int(input())
#N, K = map(int, input().split())
#A = list(map(int, input().split()))
#flag = True
#for k in range(N):
ans = N*N*N
print(ans)
#print('Yes')
#print('No')

Submission status: Accepted

Solution code:
#140-A

N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
N=int(input())
print(N**3)

Submission status: Accepted

Solution code:
n = int(input())

print(n ** 3)

Submission status: Accepted

Solution code:
print((int(input()))**3)

Submission status: Accepted

Solution code:
n = int(input())

print(n*n*n)

Submission status: Accepted

Solution code:
d = int(input())
print(d**3)

Submission status: Accepted

Solution code:
print(int(input()) ** 3)

Submission status: Accepted

Solution code:
n = int(input())

print(n * n * n)

Submission status: Accepted

Solution code:
print((int(input()))**3)

Submission status: Accepted

Solution code:
n = int(input())
print(pow(n, 3))

Submission status: Accepted

Solution code:
n = int(input())
print(n*n*n)

Submission status: Accepted

Solution code:
N=int(input())
print(N**3)