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:
def main():
    N = int(input())
    print(N**3)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(n*n*n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

a = int(input())

print(a*a*a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=INT()
    print(n**3)
if __name__ == '__main__':
    do()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
	# n,m = map(int,input().split())
	# n,k = map(int,input().split())
	n = int(input())
	# a = list(map(int,input().split()))
	# rsp = list(str(input()))
	# l = [list(map(int, input().split())) for _ in range(n)]
	# s = list(s)
	
	print(int(n**3))


 
if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#N, W = map(int, input().split())
N = int(input())

print (N**3)

Submission status: Accepted

Solution code:


N = int(input())

print(N*N*N)

Submission status: Accepted

Solution code:
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

print(II()**3)

Submission status: Accepted

Solution code:
n = int(input())

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

def main():
  solve()


if __name__ == "__main__":
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())
ans = 0
for i in range(N):
	for j in range(N):
		for t in range(N):
			ans+=1
print(ans)#N^3が答え

Submission status: Accepted

Solution code:
var = int(input())

pas = var ** 3

print(pas)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 整数の入力
a = int(input())
# 計算式
s = a * a * a
# 出力
print(s)

Submission status: Accepted

Solution code:
# 整数の入力
a = int(input())

b = a * a * a

# 出力
print(b)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

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

print(n**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num=int(input())
print(num**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
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    print(int(input())**3)
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())

print(N**3)

Submission status: Accepted

Solution code:
# パスワード種類(1-9)
n = int(input())

# 計算
ans = n * n * n

# 出力
print(ans)

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = n**3
print(ans)

Submission status: Accepted

Solution code:
# Password
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())
count=0
for num in range(a):
    for num in range(a):
        for num in range(a):
            count+=1
print(count)

Submission status: Accepted

Solution code:
N = int(input())

pattern = N ** 3
print(pattern)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools

n = int(input())

print(n**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
a = int(input())
y = [x for x in range(1,a+1)]
print(len(list(itertools.product(y,repeat = 3))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

P = N * N * N

print(P)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

num = n**3
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
for a in range(n):
    for b in range(n):
        for c in range(n):
            total = str(a)+str(b)+str(c)
            ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

p=input().rstrip()

print(int(p)**3)

Submission status: Accepted

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

p=input().rstrip()
p=int(p)
print(p**3)

Submission status: Accepted

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

p=int(input().rstrip())
print(p**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


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


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# 2019-11-18 00:38:19(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np 


def main():
    n = int(sys.stdin.readline().rstrip())
    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:
n=int(input())
s = 1
print(s*n*n*n)

Submission status: Accepted

Solution code:
n = int(input())

cnt = 1

for i in range(3):
	cnt = cnt * n

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
ans = n**3
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 = input()

print(int(N) ** 3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Password
print(int(input())**3)

Submission status: Accepted

Solution code:
N = int(input())

result = N*N*N 

print(result)

Submission status: Accepted

Solution code:
N = int(input())

print(N*N*N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    N = I()
    print(pow(N, 3))
    return


# B
def B():
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    A()
    return


# Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(input_line):
    """Test Case
    >>> print_ans(2)
    8
    >>> print_ans(1)
    1
    """
    print(str(input_line ** 3))

if __name__ == '__main__':
    s = int(input().rstrip())
    print_ans(s)

Submission status: Accepted

Solution code:
# ABC 140: A – Password
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())
b = a**3
print(b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from enum import Enum
from queue import Queue

import numpy as np

import collections
import bisect
import sys
import math
import heapq

from scipy.sparse.csgraph import floyd_warshall

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

Submission status: Accepted

Solution code:
n = int(input())

ans = n ** 3
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(n * n * n)

Submission status: Accepted

Solution code:
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    print(n ** 3)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
n = int(input())

s = n * n * n

print(s)

Submission status: Accepted

Solution code:
N = int(input())

if N == 1:
  print(1)
elif N == 2:
  print(8)
elif N == 3:
  print(27)
elif N == 4:
  print(64)
elif N == 5:
  print(125)
elif N == 6:
  print(216)
elif N == 7:
  print(343)
elif N == 8:
  print(512)
elif N == 9:
  print(729)

Submission status: Accepted

Solution code:
x = input()
a = int(x)

print(a*a*a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, = map(int, input().split())
password = a ** 3
print(password)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()
n=int(N)
for n_ in range (n):
    n_=n**3
print(n_)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf8 -*-

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

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:
def main():
# input
    n = int(input())
    print(n**3)

# loop


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#140
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())
total = 0
if N == 1:
    total += 1
else:
    for i in range(1,N+1):
        for j in range(1,N+1):
            for k in range(1,N+1):
                total += 1
print(total)

Submission status: Accepted

Solution code:

N = int(input())

print(N ** 3)

Submission status: Accepted

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

number = N*N*N
print(number)

Submission status: Accepted

Solution code:
N = int(input())


def solve(N):
    return N ** 3


print(solve(N))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 18,Oct,2019
"""

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

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

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:
import os

def main():
#    print(os.sys.path)
    num = int(input())
    print(num**3)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import *

n = int(input())

print(int(pow(n,3)))

Submission status: Accepted

Solution code:
import math
i = int(input())
if i==1:
  print(1)
else:
  print(pow(i,3))

Submission status: Accepted

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

#output
print(pow(N, 3))

Submission status: Accepted

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

print(pow(N,3))

Submission status: Accepted

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

Submission status: Accepted

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

    print(n*n*n)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
i = int(input())

print(i**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(N ** 3 if N > 1 else 1)

Submission status: Accepted

Solution code:
n = int(input())
li = range(1,n+1)
le = len(li)
print(le ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
d1 = 1
d2 = 1
d3 = 1
password = [d1,d2,d3]
counter = 0
while d3 <= n and d2 <= n and d1 <= n:
    if d3 == n and d2 != n:
        d2 += 1
        d3 = 1
    elif d2 == n and d3 == n:
        d1 += 1
        d2 = 1
        d3 = 1
    else:
        d3 += 1
    password = [d1, d2, d3]
    counter += 1
print(counter)

Submission status: Accepted

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


def solve(N: int):
    print(pow(N, 3))
    return


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#数値が一つの場合
n = int(input())
#求めるパスワードの組み合わせは
#n * n * n = n ** 3（入力の３乗）
print(n ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
print(len(list(itertools.product(range(1, int(input()) + 1), repeat=3))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(N ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

N = int(input())

ans = N ** 3

print(ans)

Submission status: Accepted

Solution code:
from math import pow

n = int(input())

print(n **3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print('%d' % (N ** 3))

Submission status: Accepted

Solution code:
N = int(input())
s = len(range(1, N+1))
print(s**3)

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

res = n*n*n
print(res)

Submission status: Accepted

Solution code:
tmp = int(input())

ans = tmp * tmp * tmp

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

N = int(stdin.readline())

print(N*N*N)

Submission status: Accepted

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
    print(ans)
    
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
import itertools
N=int(input())
L1=list(range(1,N+1))
ANS=list(itertools.product(L1,repeat=3))
print(len(ANS))

Submission status: Accepted

Solution code:
N = int(input())

print(str(N*N*N))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import math
import numpy as np
# from functools import lru_cache

args = sys.argv
if len(args) == 2:
  from IPython import embed
  em = True
else:
  em = False

#### input
N = int(input())
# a, b, c, d = map(int, input().split())
# a = list(map(int, input().split()))
# a = list(map(lambda x: int(x)*(-1), a))  # 各要素を-1倍


# n = int(input())
# t = [int(input()) for i in range(n)]
if em: sys.stdin = open('/dev/tty')

#### functions
# @lru_cache(maxsize=10000)

#### process
# if em: embed()

## heapsort, O(logN)
# import heapq
# heapq.heapify(A)
# min = heapq.heappop(A)
# heapq.heappush(A, new_element)
print(N**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

m = n**3

print(m)

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:
def func(n):
    return n ** 3

n = int(input())
print(func(n))

Submission status: Accepted

Solution code:
# coding: utf-8


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N = int(input())

print(str(N ** 3))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

X = (N)**3

print(X)

Submission status: Accepted

Solution code:
# ABC140 - Password

N = int(input())

print(pow(N,3))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq

# decimal.getcontext().prec = 50
# sys.setrecursionlimit(10000)
# MOD = 10**9 + 7

def solve(f):
    n = f.read_int()
    return n**3


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case #%d\n"%f.case, solve(f)
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

Submission status: Accepted

Solution code:
n = int(input())


print(n * n * n)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    print(n**3)
    return

#B
def B():
    n = II()
    a = LI()
    b = LI()
    c = LI()
    ans = 0
    for i in range(n):
        ans += b[a[i] - 1] + (c[a[i] - 1] if i != n - 1 and a[i] + 1 == a[i + 1] else 0)
    print(ans)
    return

#C
def C():
    n = II()
    b = LI()
    ans = b[0]
    for i in range(n-1):
        if b[i] >= b[i + 1]:
            ans += b[i + 1]
        else:
            ans += b[i]
    print(ans)
    return

#D
def D():
    n, k = LI()
    s = S()
    a = []
    for i in range(n):
        if i == n - 1:
            a.append(s[i])
        elif s[i] != s[i + 1]:
            a.append(s[i])
    print(min(n - 1, n - len(a) + 2 * k))
    return

#E
def E():
    return

#F
def F():
    return


#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
#coding:utf-8

N = int(input())

print(N**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import permutations

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

Submission status: Accepted

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(n**3)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#a,b=map(int,input().split())
#p_3,p_4=map(int,input().split())
n=int(input())
#S=input()
#T=input()
#recipe=[list(input().split())for _ in range(n)]
#m=int(input())
#have=[list(input().split())for _ in range(m)]
#s=[list(input())for _ in range(n)]
#h=list(map(int,input().split()))
#v=list(map(int,input().split()))
#c=list(map(float,input().split()))
#n=int(input())
#s=[list(map(int,input().split()))for _ in range(n)]
#s=[list(input().split())for _ in range(n)]
#s=[input()for _ in range(n)]
print(n**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()

print(int(N)**3)

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

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

print(n ** 3)

Submission status: Accepted

Solution code:
n=int(input())

print(n*n*n)

Submission status: Accepted

Solution code:
import numpy as np

a = int(input())

a = a*a*a

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = int(0)

ans = N**3
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

i = N**3
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#単入力
n=int(input())

print(n**3)