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: Accepted

Solution code:
import sys

#+++++
		
def main():
	a = int(input())
	print(a**3)
	
	
#+++++


if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

print(N ** 3)

Submission status: Accepted

Solution code:
N = int(input())

if N == 1:
  print(1)
else:
  ans = 1
  for i in range(3):
    ans = ans*N
  print(ans)

Submission status: Accepted

Solution code:
num = int(input())
print('{0}'.format(num ** 3))

Submission status: Accepted

Solution code:

n = int(input())

print(pow(n, 3))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i=int(input())

print(i**3)

Submission status: Accepted

Solution code:
n = int(input())
l = [i for i in range(1,n+1)]
ans = 0
for i in l:
    for j in l:
        for k in l:
            ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


n = int (input())
print(n**3)

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())
print(N*N*N)

Submission status: Accepted

Solution code:
# -*-coding:utf-8-*-
"""
3桁のパスワードを設定する。使える文字は1以上N以下の数値である。パスワードは３つの文字を独立して区別するので.
答えはN**3となる
"""
N=int(input())
print(N**3)

Submission status: Accepted

Solution code:
a = input("")
a = int(a)
b = 1
for i in range(3):
  b *= a
print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())

ANS = N**3

print(ANS)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
while True:
    try:
        n = int(input())
        print(n ** 3)
    except:
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
import math
import time
ts=time.time()
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

n=I()
print(n**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    a()

Submission status: Accepted

Solution code:
N = int(input())

if N == 1:
  print(1)

else:
  Ans = N
  i = 1
  while 3 > i:
    Ans = Ans * N
    i += 1
  print(Ans)

Submission status: Accepted

Solution code:
N  = int(input())

print(N**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = N **3

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
z =  [1, 2, 3, 4, 5, 6, 7, 8, 9]
while True:
    str_n = input()
    int_n = int(str_n)
    if int_n in z:
        break
print(pow(int_n,3))

Submission status: Accepted

Solution code:
import sys
#template by uwi 
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

n = ni()
print(n**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
# pythonはinputを文字列として扱うのでintで整数に変換する。
A = int(N)
print(A**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t=int(input())

print(t*t*t)

Submission status: Accepted

Solution code:
a = int(input())

print(pow(a, 3))

Submission status: Accepted

Solution code:
def A_Password():
    N =int(input())
    print(pow(N,3))
if __name__ == "__main__":
    A_Password()

Submission status: Accepted

Solution code:
N = int(input())

ans = 0

ans = N **3

print(ans)

Submission status: Accepted

Solution code:
#from itertools import permutations 
n = int(input())
t = n**3
print(t)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

N = int(input())
print(N**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]
    print(II()**3)




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    print(int(input()) ** 3)

Submission status: Accepted

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

def ans() :

    # 整数の入力
    a = int(input())
    #   出力
    print(a * a * a)




if __name__ == '__main__':
    ans()

Submission status: Accepted

Solution code:
n = input()
result = 0
if n == 1:
    print(1)
else:
    result = int(n) * int(n) * int(n)
    print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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



main()

Submission status: Accepted

Solution code:
n = int(input())

print(n ** 3)

Submission status: Accepted

Solution code:
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
import numpy as np

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
res = []
for k in range(1,n+1):
 for s in range(1,n+1):
  for b in range(1,n+1):
    #print(k,s,b)
    resn = str(k) + str(s) + str(b)
    #print(resn)
    resn = int(resn)
    res.append(resn)
print(len(res))

Submission status: Accepted

Solution code:
N = int(input())

print(N * (N ** 2))

Submission status: Accepted

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

# input
N = int(input())

# solve & output
print(N ** 3)

Submission status: Accepted

Solution code:
n = int(input())
ans = 0

for i in range(1, n+1):
    for j in range(1, n+1):
        for k in range(1, n+1):
            ans += 1

print(ans)

Submission status: Accepted

Solution code:
aiue = int(input())

aa = aiue*aiue*aiue

print(aa)

Submission status: Accepted

Solution code:
N = int(input())
pN = pow(N, 3)

print(pN)

Submission status: Accepted

Solution code:
_ = int(input())
ans = 0
for i in range(_):
    for j in range(_):
        for k in range(_):
            ans += 1
print(str(ans))

Submission status: Accepted

Solution code:
N = int(input())

print(N**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

s = N*N*N

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(n+1):
  for j in range(n+1):
    for k in range(n+1):
      if i!=0 and j!=0 and k!=0:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
n = input()

n = int(n)

n = pow(n,3)
print(n)

Submission status: Accepted

Solution code:
import math
print(int(math.pow(len(range(int(input()))), 3)))

Submission status: Accepted

Solution code:
n = int(input())

out=n
for i in range(2):
    out*=n

print(out)

Submission status: Accepted

Solution code:
N = int(input())

answer = N ** 3

print(answer)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:

N = int(input())

l = []
for i in range(1, N + 1):
        for j in range(1, N + 1):
                for k in range(1, N + 1):
                     l.append("".join(str(i) + str(j) + str(k)))
print(len(l))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = 0
for i in range(N):
  for j in range(N):
    for k in range(N):
      ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
# import random
# import bisect
# import math
import numpy as np
# from fractions import gcd
# import itertools

"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)

    def lcm(self, x, y):
        return (x * y) // self.gcd(x, y)


"""ここからメインコード"""


def make_divisors(n):
    # divisors = []
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            # divisors.append(i)
            return i
            # if i != n // i:
            #     divisors.append(n//i)


def n_to_10(X, n):
    if int(X / n):
        return n_to_10(int(X / n), n) + str(X % n)
    return str(X % n)


def main():
    ip = IP()
    id = Idea()
    """この下から書いてね"""
    n = int(input())
    print(n ** 3)



main()

Submission status: Accepted

Solution code:
n = int(input())


      

print(n*n*n)

Submission status: Accepted

Solution code:
N = int(input())

count = 0

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))
            count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int):
    print(N * N * N)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python
# coding: UTF-8

from math import *
import os
import sys

#import scipy.optimize
import numpy as np


##################################################################
if __name__ == "__main__":
    #Input = [input() for i in range(1)]
    N = int(input())
    print(N*N*N)

Submission status: Accepted

Solution code:
import sys
import itertools
n = int(sys.stdin.readline())
L = [i for i in range(1,n+1)]
a = list(itertools.product(L, repeat=3))
print(len(a))

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""
n=  int(sys.stdin.readline())
print(n**3)

Submission status: Accepted

Solution code:
x = int(input())

print(x**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
count = 0

for i in range(1,n+1):
    for k in range(1,n+1):
        for j in range(1,n+1):
            count += 1
            
            
print(count)

Submission status: Accepted

Solution code:
N = input()

print pow(N,3)

Submission status: Accepted

Solution code:
from itertools import product

n = int(input())
l = list([i for i in range(1,n+1)])
ans = 0
for i in product(l , repeat=3):
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
pas = []
for i in range(1,N+1):
  for j in range(1,N+1):
    for k in range(1,N+1):
      pas.append(''.join([str(i),str(j),str(k)]))
print(len(set(pas)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(int(N**3))

Submission status: Accepted

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

digit = int(input())
print(digit * digit * digit)

Submission status: Accepted

Solution code:
N = int(input())

result = pow(N,3)
print(result)

Submission status: Accepted

Solution code:
n = int(input())

ans = n**3

print(ans)

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque




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




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

print(n*n*n)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy
from collections import Counter, deque
import heapq
from functools import reduce
sys.setrecursionlimit(200000)
# local only
# if not __debug__:
#     fin = open('in_1.txt', 'r')
#     sys.stdin = fin
# local only
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()
# template


def main():
    N = ii()
    print(pow(N, 3))
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

N=int(input())

ans=N**3

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import product

n = int(input())

print(len(list(product(list(range(1,n+1)), repeat=3))))

Submission status: Accepted

Solution code:

N = [int(s) for s in raw_input().split(" ")][0]
res = 1
for _ in xrange(3):
    res *= N
print(res)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

n = int(input())

sum = n*n*n

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
N=int(sys.stdin.readline().rstrip())
print(N**3)

Submission status: Accepted

Solution code:
N = int(input())

n = pow(N, 3)
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left


INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LIM(): return list(map(lambda x:int(x) - 1, sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def LIRM(n): return [LIM() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
mod = 1000000007


n = I()
print(n ** 3)

Submission status: Accepted

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

ans= N ** 3
print(ans)

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def conb(n,r): return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


n = inp()
print(n**3)

Submission status: Accepted

Solution code:
#Password

N = int(input())
print(N*N*N)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N = int(input())
print(N**3)

Submission status: Accepted

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

Submission status: Accepted

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

print(n ** 3)

Submission status: Accepted

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

N = int(raw_input())

C = N*N*N

print(C)

Submission status: Accepted

Solution code:
N = int(input())

list_aaa=[]
cnt = 0

for i in range(1,N+1):
    for j in range(1,N+1):
        for k in range(1,N+1):
            list_aaa.append(str(i)+str(j)+str(k))
            cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
#gcdは3.4.3だとfractionsにある
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n = ii()
    print(n**3)


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
print ( a ** 3)

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(1,n+1):
    for j in range(1,n+1):
        for k in range(1,n+1):
            ans += 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

if n >= 1 and n <= 9:
    ans = n ** 3

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(M)

Submission status: Accepted

Solution code:
N = int(input()) #ここで標準入力
# print (type(N),N) 

print(N*N*N)

Submission status: Accepted

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

Submission status: Accepted

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

import sys, os
def ac_input(*args):
    return map(int, input().split())


def main():
    a = input()
    ans = int(a) * int(a) * int(a)
    print(ans)

if __name__ == "__main__" :
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())
r = []
for i in range(1,N+1):
    for j in range(1,N+1):
        for k in range(1,N+1):
            r.append(str(i) + str(j) + str(k))


print(len(r))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N =	 int(input())

print(N**3)

Submission status: Accepted

Solution code:
import sys; from collections import deque ; readline = sys.stdin.readline

N = int(readline())
print(N ** 3)

Submission status: Accepted

Solution code:
N = int(raw_input())

print pow(N, 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def main():
    input = sys.stdin.readline
    N = int(input())
    ans = N ** 3

    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
res = 0
for i in range(111, 1000):
    s = str(i)
    if '0' in s:
        continue
    flag = True
    for c in s:
        if not (1 <= int(c) <= n):
            flag = False
    if flag:
        res += 1
print(res)

Submission status: Accepted

Solution code:
from itertools import accumulate
import sys

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

N = int(input())

print(N ** 3)

Submission status: Accepted

Solution code:
def calc(n):
    return n*n*n


n = int(input())
r = calc(n)
print(r)

Submission status: Accepted

Solution code:
a = int(input())

print(a**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for i in range(1,n+1):
    for x in range(1, n+1):
        for z in range(1, n+1):
            ans += 1
print(ans)

Submission status: Accepted

Solution code:
n_str = input()
N = int(n_str)
result = pow(N,3)
print(result)

Submission status: Accepted

Solution code:
x=int(input())

res=x**3

print(res)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# 出力
print("{}".format(a ** 3))

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    print(n ** 3)
    
    return 0

main()

Submission status: Accepted

Solution code:
S = int(input())

print(S**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
N=int(input())

answer=N**3
print(answer)

Submission status: Accepted

Solution code:
# A - Password
N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
i = int(input())
r = i*i*i
print(r)

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N] = [int(input_raw[0])]
    print N ** 3


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
N = int(input())

print(N * N * N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
import sys


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








if __name__ =='__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())


print(n**3)

Submission status: Accepted

Solution code:
n = int(input())

count = 0

for i in range(1, n+1):
  for j in range(1, n+1):
    for k in range(1, n+1):
      count += 1
      
print(count)

Submission status: Accepted

Solution code:


n = int(input())

ans = n * n * n

print(ans)

Submission status: Accepted

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

N = int(input())

print(N ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Password
N = int(input())

result = N * N * N

print(result)

Submission status: Accepted

Solution code:
N = int(input())

A = N*N*N
print(A)

Submission status: Accepted

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

Submission status: Accepted

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

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    n = int(lines[0])

    return (n,)


def solve(n):


    return n * n * n


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r)
    else:
        print("%s" % result)

if __name__ == '__main__':

    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
import sys
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
sys.setrecursionlimit(10 ** 9)


def main():
    N = INT()

    print(N*N*N)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

anc = N**3
print(anc)

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

N = int(sys.stdin.readline())

ans = N*N*N

print(ans)

Submission status: Accepted

Solution code:
def main():

  N = int(input())
  print(N ** 3)

if __name__ == "__main__":
    main()