Problem:


Score : 100 points

Problem Statement

Given is an integer r.

How many times is the area of a circle of radius r larger than the area of a circle of radius 1?

It can be proved that the answer is always an integer under the constraints given.

Constraints

1 \leq r \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

r

Output

Print the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.

Sample Input 1

2

Sample Output 1

4

The area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.

Note that output must be an integer - for example, 4.0 will not be accepted.

Sample Input 2

100

Sample Output 2

10000



Sample input:
2


Sample output:
4

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() 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)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


r = I()
print(r ** 2)

Submission status: Accepted

Solution code:
def circle(r):

    return r**2
def main():
    r = int(input())
    print(circle(r))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

ans = int(r ** 2)
print(ans)

Submission status: Accepted

Solution code:
import sys

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


def solve():
    r = int(input())
    print(r**2)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import math

r = int(input())

print(str(r ** 2))

Submission status: Accepted

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

Submission status: Accepted

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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    r = int(input())
    print(r**2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
    r = int(readline())

    print(r**2)
    

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

print((int(sys.stdin.readline())) ** 2)

Submission status: Accepted

Solution code:
r = int(input())

print(int(r**2))

Submission status: Accepted

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

print(I()**2)

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())
def S(): return sys.stdin.readline().rstrip()

print(I()**2)

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(int(n * n))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import math

r = int(input())

print(math.floor(r * r))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r  =int(input())

print(int(r*r))

Submission status: Accepted

Solution code:
# -*- coding: <encode name> -*-

r = int(input())
print(r ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

r = int(input())
print(r**2)

Submission status: Accepted

Solution code:

R=int(input())

print(int(R**2))

Submission status: Accepted

Solution code:
r = int(input())

print(r**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

r = int(input())
print(r**2)

Submission status: Accepted

Solution code:
r_input = input().split()
r = int(r_input[0])
print(r*r)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
r = int(input())

m = int(3.14*r*r) + 1
ans = int(m/3.14)
print(ans)

Submission status: Accepted

Solution code:

if __name__ == "__main__":
    r = int(input())
    print(r * r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

print(a**2)

Submission status: Accepted

Solution code:
def recta():
    r = int(input())
    area1 = r**2
    print(area1)


if __name__ == "__main__":
    recta()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import fileinput
from math import pi

r = int(input())

print(r * r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ABC_145_A():
    r = int(input())
    print(r*r)

if __name__ == '__main__':

    ABC_145_A()

Submission status: Accepted

Solution code:
# A - Circle
def main():
    r = int(input())
    print(r**2)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    r = int(input())
    print(r*r)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


r = I()
print(int(r**2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import pow
print(int(pow(int(input()),2)))

Submission status: Accepted

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

S1 = 1

r = input()
R = int(r)
S2 = R ** 2

result = S2 / S1
print(int(result))

Submission status: Accepted

Solution code:
def main():
    N = int(input())  # 文字列または整数(一変数)

    print(N**2)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# A - Circle

print(int(input()) ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def printlist(lst, k='\n'): return k.join(list(map(str, lst)))
INF = float('inf')

def solve():
    r = II()
    print(r ** 2)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    r = int(input())
    if (1 <= r <= 100) == False:
        print("error")
        exit(1)

    print (r ** 2)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
   r = int(input())
   print(pow(r,2))

Submission status: Accepted

Solution code:
def main():
    r = int(input())
    print(r**2)
    return 0


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r = int(input());

print(r**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun May  3 18:07:38 2020

@author: Kanaru Sato
"""

r = int(input())
print(r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

r = ri()

print(r**2)

Submission status: Accepted

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

r = int(input())

print(r ** 2)

Submission status: Accepted

Solution code:

r=int(input())
print(r**2)

Submission status: Accepted

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

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


main()

Submission status: Accepted

Solution code:
#2020-04-30
r = int(input())
print(r ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = input()

area = int(r)*int(r)

print(area)

Submission status: Accepted

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

Submission status: Accepted

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


def solve(r: int):
    print(pow(r, 2))
    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()
    r = int(next(tokens))  # type: int
    solve(r)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r = float(input())
re1 = 1 * 1
re =  r * r

print(int(re/re1))

Submission status: Accepted

Solution code:
import os

def main():
	r = int(input())
	print(r*r//1)

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:

r = int(input())

en = r**2
ans = en//1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
rad = int(input())
S = round(rad*rad,0)
print(S)

Submission status: Accepted

Solution code:
N = int(input())

print(N**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

r = int(input())
print(int(r * r))

Submission status: Accepted

Solution code:
PI = 3
base_area = 1*1*PI

rad = int(input())
ans_area = rad*rad*PI

print(int(ans_area/base_area))

Submission status: Accepted

Solution code:
r = int(input())

ans = r ** 2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

a = stdin.readline().rstrip()
a = int(a)
print(a*a)

Submission status: Accepted

Solution code:
r=int(input())

print(int(r*r))

Submission status: Accepted

Solution code:
print(int(input().strip('\n'))**2)

Submission status: Accepted

Solution code:
import sys
from bisect import bisect_right as bsr
from collections import Counter as cnt
from collections import defaultdict as dd
from collections import deque
from fractions import gcd
from itertools import permutations as perm
from math import ceil, factorial, floor
from operator import itemgetter as ig

sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    R = input(int)
    print(R ** 2)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

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

ans = r ** 2
print(ans)

Submission status: Accepted

Solution code:
r = int(input())

print(round(r * r / 1))

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    r = int(stdin.readline())

    if r < 1:
        print(0)
    else:
        circle = r * r
        print(circle)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

r = int(stdin.readline())

if r < 1:
    print(0)
else:
    circle = r * r
    print(circle)

Submission status: Accepted

Solution code:
#--Circle

r = int(input())
print(r**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

print(a*a)

Submission status: Accepted

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

Submission status: Accepted

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

print(r * r)

Submission status: Accepted

Solution code:
import math
import fractions
import sys
import itertools
import numpy as np
#入力: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))

r=input1()
print(r**2)

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

r = INT()
print(r**2)

Submission status: Accepted

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


def solve(r: int):
    print(r*r)
    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()
    r = int(next(tokens))  # type: int
    solve(r)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
print(int(r*r/1))

Submission status: Accepted

Solution code:
r = int(input())

# a, b =map(int,input().split())
print(r*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

r = int(input())

print(r**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 初期入力
r = int(input())
#mennseki_r =3.14*r*r
#mennseki_1 =3.14*1*1

#kotae =int(mennseki_r / mennseki_1)
kotae=r*r
print(kotae)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC145 - Virtual
# A
if True: print(int(input())**2)

# B
# C
if False:
    import itertools

    def fact(n,mod):
        ret=1
        for i in range(2,n+1):
            ret=(ret*i)%mod
        return ret

    N=int(input())
    X=[tuple(map(int,input().split())) for _ in range(N)]
    ans=0
    for p in itertools.permutations(X):
        # print(p)
        sx,sy=p[0]
        for x,y in p:
            ans+=((sx-x)**2+(sy-y)**2)**0.5
            sx,sy=x,y
        # print(ans)
    ans/=fact(N,10**9+7)
    print(ans)

# D
# E

Submission status: Accepted

Solution code:

r = int(input())

print(int(r**2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

r = int(sys.stdin.readline())
print(r**2)

Submission status: Accepted

Solution code:
a=int(input())

print(a*a)

Submission status: Accepted

Solution code:
d = int(input())

print(d*d)

Submission status: Accepted

Solution code:
r = int(input())

answer = r ** 2

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())

print(int(r**2))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import Counter, deque

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 

def resolve():
    r = int(input())
    print(r**2)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

print(r*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

r = int(readline())
print(r ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
#A,B = list(map(int,input().split()))

print(r*r)

Submission status: Accepted

Solution code:
# ABC 145: A – Circle
print(int(input()) ** 2)

Submission status: Accepted

Solution code:
i = int(input())

print(i * i)

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  r = int(read())
  print(r**2)
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
s = input()

print(int(s)**2)

Submission status: Accepted

Solution code:
# coding: utf-8

r = int(input())
r = r*r

print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

def main():
    print(r ** 2)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

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

R = ir()
print(R ** 2)

Submission status: Accepted

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

print(math.floor(r*r))

Submission status: Accepted

Solution code:
r = int(input())

print((r)**2)

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

# 多次元配列
# dp = [[0] * 3 for _ in range(5)]

# 入力を受け取る
print(int(input()) ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

r = input()
print(int(r) * int(r))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = r ** 2
print(ans)

Submission status: Accepted

Solution code:
r=int(input())
size=r**2
print(size)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

print(num * num)

Submission status: Accepted

Solution code:
r = int(input())
h = r**2
print(h)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solver():
    r = int(input())
    print(r * r)


if __name__ == '__main__':
    solver()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

ans = r * r
print(ans)

Submission status: Accepted

Solution code:
#145_A
r = int(input())
print(r ** 2)

Submission status: Accepted

Solution code:
r= input()

print r**2

Submission status: Accepted

Solution code:
r = int(input())

ans =int(r**2)

print(ans)

Submission status: Accepted

Solution code:
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np
# import math
# mod = 10**9 + 7

# n = int(input())
# a = list(map(int, input().split()))
n = int(input())
# s = input()

print(n**2)

Submission status: Accepted

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

def main():
    r = int(input())
    print(r**2)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

r = int(input())
# print(r)
print(r*r)

Submission status: Accepted

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

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

    print(r * r)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#a,b = map(int,input().split())
r = int(input())
print(r**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
print(pow(r,2))

Submission status: Accepted

Solution code:
r = int(input())

ans = r ** 2

print(ans)

Submission status: Accepted

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

print(solve())

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

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

r = int(input())
print(r ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r =int( input())

print(r**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
r= int(input())

print(r*r)

Submission status: Accepted

Solution code:
def solve():
    r = int(input())
    print(r*r)

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
r=int(input())
R=r**2
print(R)

Submission status: Accepted

Solution code:
# A - Circle
r=int(input())
print(r**2)

Submission status: Accepted

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

    print(r**2)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#A
r=int(input())
print(r**2)

Submission status: Accepted

Solution code:
r = int(input())

print(int(r * r))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import math
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
from functools import reduce
sys.setrecursionlimit(4100000)
from functools import lru_cache
INF = 1 << 60

#ここから書き始める
t = int(input())
print(t ** 2)

Submission status: Accepted

Solution code:
r = int(input())
Sr = 3 * r ** 2
S1 = 3 * 1 ** 2
print(Sr // S1)

Submission status: Accepted

Solution code:
r  = int(input())

print(int(r**2))

Submission status: Accepted

Solution code:
r=int(input())
print(r**2//1)

Submission status: Accepted

Solution code:
r = int(input())

ans = r**2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

surface = r **2

print(surface)

Submission status: Accepted

Solution code:
r = int(input())

print(r*r//1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

print(r**2)

Submission status: Accepted

Solution code:
r = int(input())

print(r * r )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math 
baseArea = math.pi 
N = int(input())

print(N ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if __name__ == '__main__':
  r = int(input())
  print(r * r)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    r = int(input())
    print(r**2)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

print((int(input()))**2)

Submission status: Accepted

Solution code:

r = int(input())
print(r*r)

Submission status: Accepted

Solution code:
def calc_r(r):
  return r*r

r = int(input())
result = calc_r(r)
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

ans = r*r
print(ans)

Submission status: Accepted

Solution code:
r = int(input())
#a = list(map(int,input().split()))

print(r*r)

Submission status: Accepted

Solution code:
num = int(input())

print(num**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
in_data = [int(input()) for i in range(1)]
print(in_data[0] ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print (r*r)

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
import queue
import copy


#X = str(input()).split()
#a = [int(x) for x in input().split()]


r = int(input())
ans = r*r


print(ans)

Submission status: Accepted

Solution code:

r = int(input())
print (r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(N**2)

Submission status: Accepted

Solution code:
#python3

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

main()

Submission status: Accepted

Solution code:
r = int(input())
n = (r*r) / 3.14
print(int(n / (1/3.14)))

Submission status: Accepted

Solution code:
r = int(input())
res = r**2

print(res)