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:
a=int(input())
n=list(range(1,a+1))
m=n
o=n
count=0
for i in n:
  for j in m:
    for q in o:
        u=i,j,q
        count+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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


main()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import os, sys, re, math

N = int(input())

print((N - 1 + 1) ** 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:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def factorization(n):
	tmp=n
	count=0
	for i in range(2,int(n**0.5)+2):
		if tmp%i==0:
			cnt=0
			while tmp%i==0:
				cnt+=1
				tmp//=i
			count+=1
	if tmp!=1:
		count+=1

	return count
			




N=input1()

print(N**3)

Submission status: Accepted

Solution code:
n=int(input())
print("{} ".format(n*n*n))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    print(N**3)
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

print(int(input()) ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = N**3
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest

def resolve():
    n = int(input())

    print(n ** 3)

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """2"""
        output = """8"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """1"""
        output = """1"""
        self.assertIO(input, output)

if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

Solution code:
# 初期入力
N = int(input())

#
pass_syurui =N**3
print(pass_syurui)

Submission status: Accepted

Solution code:
n = int(input())
print(n**3)
'''
import itertools
a = []
for i in range(1,n+1):
    a.append(i)
l = list(itertools.product(a,repeat=3))

print(len(l))
print(l)
'''

Submission status: Accepted

Solution code:
x = int(input())

print(x ** 3)

Submission status: Accepted

Solution code:
N=int(input())

print(N*N*N)

Submission status: Accepted

Solution code:
import os

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

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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()))	
s =[]
for i in range(n):
    for j in range(n):
        for k in range(n):
            t= (i,j,k)
            s.append(t)
print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

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

Submission status: Accepted

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

print(N**3)

Submission status: Accepted

Solution code:
a = int(input())

print(a*a*a)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
print(N**3)

Submission status: Accepted

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

Submission status: Accepted

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

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    n = ii()
    print(n ** 3)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

if __name__ == "__main__":
     main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(N * N * N)

Submission status: Accepted

Solution code:
a = int(input())

print(a*a*a)

Submission status: Accepted

Solution code:

print( int(input()) ** 3 )

Submission status: Accepted

Solution code:
[print(int(n)**3) for n in input()]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

print(num ** 3)

Submission status: Accepted

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


if __name__ == '__main__':
    q1()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
n=I()
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())

answer = N ** 3

print(answer)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from itertools import *
from collections import *

INF = float('inf')

""" Input
S = input().rstrip()
N, A, B = map(int, input().split())
A = list(map(int, input().split()))
D = [int(input()) for _ in range(N)]
"""

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Problem A - Password

# input
N = int(input())

# initialization
print(N**3)

Submission status: Accepted

Solution code:
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:
def solve():
    n = int(input())
    print(n**3)
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
n = int(input())

ans = 0
for i in range(111, 1000):
    str_i = str(i)
    if str_i.count('0') != 0:
        continue

    for j in range(n+1, 10):
        if str_i.count(str(j)) != 0:
            break
    else:
        ans += 1

print(ans)

Submission status: Accepted

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


resolve()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

print(INT() ** 3)

Submission status: Accepted

Solution code:
# ABC 140: A – Password
print(int(input()) ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

n = int(sys.stdin.readline().rstrip())

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  n = int(input())
  print(n**3)
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#                       _oo0oo_
#                      o8888888o
#                      88" . "88
#                      (| -_- |)
#                      0\  =  /0
#                    ___/`---'\___
#                  .' \\|     |// '.
#                 / \\|||  :  |||// \
#                / _||||| -:- |||||- \
#               |   | \\\  -  /// |   |
#               | \_|  ''\---/''  |_/ |
#               \  .-\__  '-'  ___/-. /
#             ___'. .'  /--.--\  `. .'___
#          ."" '<  `.___\_<|>_/___.' >' "".
#         | | :  `- \`.;`\ _ /`;.`/ - ` : | |
#         \  \ `_.   \_ __\ /__ _/   .-` /  /
#     =====`-.____`.___ \_____/___.-`___.-'=====
#                       `=---='
#
#
#     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#
#               佛祖保佑         永无BUG

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

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

print(ir() ** 3)
# 24

Submission status: Accepted

Solution code:
n = int(input())

if n == 1:
    print(1)

else:
    print(n **3)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

def main():
    N = int(input())

    print(N**3)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#%%
import sys
def input():
    return sys.stdin.readline().rstrip()

def main():
    N = int(input())

    print(N**3)

# %%
if __name__ == '__main__':
    main()

# %%
# from atcoder_test import doTest
# doTest("abc140","a",main)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#３桁のパスワード９文字　ｎの三乗
print(int(input()) ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

answer = N * N * N

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Password
https://atcoder.jp/contests/abc140/tasks/abc140_a

"""
import sys


def solve(N):
    return N**3


def main(args):
    N = int(input())
    ans = solve(N)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(N**2*N)

Submission status: Accepted

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
N= int(input())

print(N*N*N)

Submission status: Accepted

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

n = int(input())

print(n*n*n)

Submission status: Accepted

Solution code:
a = int(input())
#s = str(input())
print(a**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:
#A PASSWORD
n=int(input())
print(n**3)

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter

import numpy as np
# import scipy as scp

# 入力の受け取り
n = int(input())

ans = n**3

print(ans)
# print("{:.10f}".format(ans))

Submission status: Accepted

Solution code:
def solve():
    N = int(input())
    return N * N * N

print(solve())

Submission status: Accepted

Solution code:
import itertools
n=int(input())
a=[]
for i in range(1,n+1):
    a.append(i)

v=list(itertools.product(a,repeat=3))
print(len(v))

Submission status: Accepted

Solution code:
x = int(input())

print(x*x*x)

Submission status: Accepted

Solution code:
a = int(input())

print(a**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

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



if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
cnt = []
for i in range(1, n + 1):
    for j in range(1, n + 1):
        for k in range(1, n + 1):
            s = str(i) + str(j) + str(k)
            if s not in cnt:
                cnt.append(s)
#print(cnt)
print(len(cnt))

Submission status: Accepted

Solution code:
#import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
class Solution:
    def solve(self, N: int) -> str:

        return N ** 3


if __name__ == '__main__':

    # standard input
    N = int(input())

    # solve
    solution = Solution()
    print(solution.solve(N))

Submission status: Accepted

Solution code:
num=int(input())

print(num*num*num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = n*n*n
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)


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


# Generated by 1.1.6 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:
N = int(input())
print (N ** 3)

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__=='__main__':
  main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	N = II()
	print(N**3)

if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

n = int(sys.stdin.readline().rstrip())

def main():
    return n ** 3

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

Solution code:
N = int(input())

cnt = 0

for i in range(N):
    for j in range(N):
        for k in range(N):
            cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
#python3

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

Submission status: Accepted

Solution code:
N = int(input())

print(int(N**3))

Submission status: Accepted

Solution code:
N = int(input())

if N == 1:
    print(1)

elif N >1:
    print(N**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc140/tasks/abc140_a

print(int(input())**3)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

print(N**3)

Submission status: Accepted

Solution code:
import sys

number = int(input())
answer = 1

for _ in range(3):
    answer *= number

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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


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
    print(solve(N))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

ans = []
for i in range(N):
  for j in range(N):
    for k in range(N):
      ans.append("{}{}{}".format(i,j,k))
		
print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
n = int(n)
def password(n):
  for i in range(1):
    print(n*n*n)
password(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print input()**3

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n=int(input())


print(n**3)

Submission status: Accepted

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


def read_int(row):
    return int(row().rstrip())
  
N = read_int(row)
print(N ** 3)

Submission status: Accepted

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


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


# Generated by 1.1.6 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:
def solve(inp):
    N = int(inp.readline().strip())

    return str(N * N * N)


def test(s):
    from io import StringIO
    print(solve(StringIO(s)))


def main():
    import sys
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    # test('')
    main()

Submission status: Accepted

Solution code:
# ABC 140 A

N = int(input())

print(N**3)

Submission status: Accepted

Solution code:

N=int(input())

print(int(pow(N,3)))

Submission status: Accepted

Solution code:
N = int(input())

ans = N**3
print(ans)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

n = INT()
print(n ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = int(input())

    count = 0

    count = n ** 3

    print(count)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int( input())

print( n**3 )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A=int(read())
print(A**3)

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())
n = N ** 3
print(n)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    N = int(input())

    A = N**3

    print(A)