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:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

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

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

if __name__=='__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    n = int(input())
    print(circle(n))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())

x=r*r

print(x)

Submission status: Accepted

Solution code:
import math

one = math.pi

r = int(input())

r *= r

print(r)

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()
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():
	r = II()
	print(r*r)

main()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

r=int(input())

print(r**2)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

def read_int(row):
    return int(row().rstrip())
  
r = read_int(row)

print(int(r **2))

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

MOD = 10 ** 9 + 7

r = int(input())

ans = r * r

print(ans)

Submission status: Accepted

Solution code:
import sys

def propare():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))

    solve(r)

def solve(r: int):
    print(int(r*r/1))
    return


 
if __name__ == "__main__":
    propare()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 24 18:13:37 2020

@author: manakamura
"""

tmp = int(input())
#tmp = input().split()
#n,k,q = list(map(lambda a: int(a), tmp))

print(tmp*tmp)

Submission status: Accepted

Solution code:
n = int(input())

print(n**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

r=int(input())

print(int(pow(r,2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 145 A

r = int(input())

print(r**2)

Submission status: Accepted

Solution code:
r = int(input())


print(r*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter,mul
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from bisect import bisect_left,bisect_right
#from copy import deepcopy
#import heapq
#import math
#import string
#from time import time
#from functools import lru_cache,reduce
#from math import factorial
#import sys
#from fractions import gcd
setrecursionlimit(10**6)
input=stdin.readline

print(int(input().rstrip())**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
if 1 <= r <= 100:
    print(int(r*r))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに

print(n**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(r*r)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r = int(input())

ans = r*r
print(ans)

Submission status: Accepted

Solution code:
S = int(input())
print(S**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:
a=int(input())
A=(a**2)
print(A)

Submission status: Accepted

Solution code:
r = int(input())

print(int(r*r))

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)

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

Submission status: Accepted

Solution code:
import sys


def solve(inp):
    r = int(inp.readline())

    return r * r


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#Coding;Utf-8

r=int(input())
print(pow(r,2))

Submission status: Accepted

Solution code:
r = int(input())

standard_area = 1

ans_area = r ** 2

ans = ans_area // standard_area

print(ans)

Submission status: Accepted

Solution code:
r = int(input())

s = 1*1
l = r*r

print(int(l/s))

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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():
    r=INT()
    print(r*r)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n1 = int(input())

r1 = n1 * n1

print(r1)

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    r = int(readline())
    print(r * r)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

rr = r*r

print(rr)

Submission status: Accepted

Solution code:
def main():
	# a,b,k = map(int,input().split())
	# n,k = map(int,input().split())
	s = int(input())
	# a = list(map(int,input().split()))
	# rsp = list(str(input()))
	# l = [list(map(int, input().split())) for _ in range(n-1)]
	# s = list(s)
	
	print(int(s**2))
	
 
 
if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
import math
sys.setrecursionlimit(200000)
input = sys.stdin.readline

N, = map(int, input().split())
# N = int(input())
# L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()] for _ in range(N)]
# L = [int(input()) for _ in range(N)]
# L = [list(input().strip())  for _ in range(N)]
# S = input().strip()

print(N ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ints():
  return [int(x) for x in input().split()]
def readi():
  return int(input())

print(readi()**2)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys


def main(argv=sys.argv):
  r = int(input())
  print(r*r)
  
  
  return 0


if __name__ == '__main__':
  sys.exit(main())

Submission status: Accepted

Solution code:
# coding: utf-8
import sys


def main(argv=sys.argv):

    r = int(input())

    pai = 3

    times = (r ** 2 * pai) // (1 ** 2 * pai)

    print(times)

    return 0


if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

Solution code:
radius = int(input())

print(radius**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print input()**2

Submission status: Accepted

Solution code:
r = input()

print r*r

Submission status: Accepted

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

Submission status: Accepted

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

r = int(input());

#print(r);

print(r*r);

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools
import bisect
import math
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

print(ni() ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

a = stdin.readline().rstrip()

print(int(a)**2)

Submission status: Accepted

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

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())**2)
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
print("{}".format((int(input()))**2))

Submission status: Accepted

Solution code:
r = int(input())

ans = r * r

print(ans)

Submission status: Accepted

Solution code:
n = int(input())

print(n * n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

Solution code:
import sys
i =int(input())
b= i**2
print(b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

area1 = int(3)*r*r
area2 = int(3)*int(1)*int(1)

t = area1/area2

print(int(t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())
r0=1*1
s1=r*r
s=s1/r0
print('%d'%s)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Spyder Editor

This is a temporary script file.
"""

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s= int(input())

print(s**2)

Submission status: Accepted

Solution code:
def solve(string):
    return str(int(string)**2)


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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


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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

R = int(input())

print(R * R)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]

print(pow(int(fetch_one_line()), 2))

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

r = int(input())
circle_r = (r ** 2)
circle_1 = (1 ** 2)
a =  int(circle_r / circle_1)
print(a)

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())

print((r*r))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

area = r **2
print(area)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_line = int(input())

result = input_line * input_line
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())

def f(r):
    return r**2

print(f(r))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
print(n * n)

Submission status: Accepted

Solution code:
r=int(input())

print(r**2)

Submission status: Accepted

Solution code:
# 円の面積公式 : πr^2

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

print(ans)

Submission status: Accepted

Solution code:
r=int(input())

ans=r*r

print(ans)

Submission status: Accepted

Solution code:
# ABC145A.py
r = int(input())

print(r*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

print(a * a)

Submission status: Accepted

Solution code:
r = int(input())


print(r * r)

Submission status: Accepted

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

Submission status: Accepted

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

print(c)

Submission status: Accepted

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














###################################################################

Submission status: Accepted

Solution code:
import sys

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

    print(r*r)

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
from itertools import count
from functools import lru_cache
from collections import defaultdict
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#


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


main()

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(r)

Submission status: Accepted

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

  return print('{}'.format(r**2))

circle()

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(r**2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(n**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
y = 2

print(int(x) ** y)

Submission status: Accepted

Solution code:
x = input()

sum = int(x) * int(x)
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = int(input())

print(s*s)

Submission status: Accepted

Solution code:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import fractions
from functools import reduce
from operator import mul
import bisect
import sys
import logging
import heapq
import itertools

logging.basicConfig(level=logging.ERROR)

input = sys.stdin.readline

setrecursionlimit(1000000)


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

def factorization(n):
	if n<2:
		return []

	arr = []
	temp = n
	for i in range(2, int(-(-n**0.5//1))+1):
		if temp%i==0:
			cnt=0
			while temp%i==0:
				cnt+=1
				temp //= i
			arr.append([i, cnt])

	if temp!=1:
		arr.append([temp, 1])

	if arr==[]:
		arr.append([n, 1])

	return arr

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(numbers):
	return reduce(fractions.gcd, numbers)

def lcm(numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

class PriorityQueue():
	def __init__(self):
		self.queue = []
	def push(self,i):
		heapq.heappush(self.queue,-i)
	def pop(self):
		return -1 * heapq.heappop(self.queue)
	def sum(self):
		return -sum(self.queue)

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())
print(r**2) # since (pi r^2)/(pi 1^2) = r^2

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

for line in sys.stdin:
    print(int(line) ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

from math import pi

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

	print(n*n)

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

r = ni()

print(r**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

ans = r**2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    # calc


if __name__ == '__main__':
    main()

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():
    return


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

Sr = r * r
S1 = 1 * 1
ans = Sr / S1

print(int(ans))

Submission status: Accepted

Solution code:
r=int(input())

a_1=r**2
print(a_1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input().rstrip())

one_area = 1
area = a * a

print(int(area / one_area))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding by utf-8
#rの入力
r = int(input())
print(r**2)

Submission status: Accepted

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

men_r = r*r
# men_1 = pi

# ans = int(men_r/men_1)
print(men_r)

Submission status: Accepted

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

import math

# 半径1の円の面積
# 1     * pi
# 半径rの円の面積
# r ^ 2 * pi

# 半径rの円の面積は
# 半径1の円の面積のr^2倍である.

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

def main():
    r = int(input())
    s = math.pi*r*r
#    print("s:"+str(s))
    base_s = math.pi
#    print("base:"+str(base_s))
    ans = s/base_s
#    print("ans:"+str(round(ans)))
    print(round(ans))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main(i):
  return print(i**2)

if __name__=="__main__":
  i=int(input())
  main(i)