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: Wrong Answer

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

ans = (r*r*math.pi)/(math.pi)

print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
pi = 3.14159265359
radius = int(input())
circle1 = pi

circle2 = pi * (radius)**2

result = circle2//circle1

print(int(result))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def A():
    return int(input())**2

A()

Submission status: Wrong Answer

Solution code:
x = int (input ())

import math
a1 = 2 * math.acos (-1)
a2 = 2 * math.acos (-1) * x


print (int ((a2 / a1) * (a2 / a1)))

Submission status: Wrong Answer

Solution code:
import math

r = int(input())


def solve():
    area = r * r * math.pi
    return math.floor(area / math.pi)


print(solve())

Submission status: Wrong Answer

Solution code:
import math

r = int(input())
pi = math.pi

print(int((r**2*pi) / (1**2*pi)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())

x = r * 2

print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())

cir = 4 * r ** 2

print(cir)

Submission status: Wrong Answer

Solution code:
import math
val = int(input())
print("%d" % val * val)

Submission status: Wrong Answer

Solution code:
r=int(input())
menseki_r=r*r*3.14
menseki_1=3.14
print(int(menseki_r/menseki_1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math 
n=int(input())
c = math.pi
cc = n*math.pi*n
print(int(cc//c))

Submission status: Wrong Answer

Solution code:
import sys,queue,copy,math
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
INF = float('inf')

r = int(input())

p = math.pi
ans = (r*r*p)/(1*1*p)
print(int(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

r = int(input())
s = math.pi
s_ = math.pi * r**2
print(int(s_/s))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	r = inputInt()

	ans = r*r*3.14
	ans2 = 3.14
	print(int(ans/ans2))

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())

print(r * 2)

Submission status: Wrong Answer

Solution code:
import math
print(math.pi * int(input()) ** 2)

Submission status: Wrong Answer

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#145-A

r = int(input())

print(r**2)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    N=ii()
    print(N**2)




if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    readline = sys.stdin.buffer.readline

    print(int(readline())**2)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest
import os

# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)


# 実装を行う関数
def resolve():
    try:
        r = int(input())

        print(pow(r, 2))

    except IndexError as err:
        print("インデックスエラー:", err.args[0])


# テストクラス
class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """2"""
        output = """4"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """100"""
        output = """10000"""
        self.assertIO(test_input, output)

    # 自作テストパターン
    def test_original(self):
        pass


# 実装orテストの呼び出し
if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        # AtCoder提出時の場合
        resolve()

    else:
        # 自PCの場合
        unittest.main(verbosity=2)

Submission status: Accepted

Solution code:
r = int(input())

print(r * r)

Submission status: Accepted

Solution code:


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 問題：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:
import sys

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  # type: int
    print(f'{solve(r)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    ans = r ** 2

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(r*r)

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF =  float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
n = int(input())
print(math.ceil((n * n * math.pi) / (1 * 1 * math.pi)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

r = int(input())

pi = int(math.pi)

a = (pi * (r)**2)
ans = a / pi

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(int(r ** 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

def main():

    r = int(input())

    ans = r ** 2

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

r = int(input())

print(r**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())

print(a**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
print(I()**2)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

r = ini()
print(r * r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a = k()
print(a**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(r ** 2 )

Submission status: Accepted

Solution code:
# abc145_a.py
# https://atcoder.jp/contests/abc145/tasks/abc145_a

# A - Circle /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 整数 rが与えられます。
# 半径 rの円の面積が半径 1の円の面積の何倍になるかを求めてください。
# なお答えは制約の下では必ず整数になることが示せます。

# 制約
#     1≤r≤100
#     入力中のすべての値は整数である。

# 入力
# 入力は以下の形式で標準入力から与えられる。
# r

# 出力

# 半径 rの円の面積が半径 1の円の面積の何倍になるかを整数で出力せよ。

# 入力例 1
# 2

# 出力例 1
# 4

# 半径 2の円の面積は半径 1 の円の面積の 4倍です。
# 4.0 などの形式で出力すると不正解になることに注意してください。

# 入力例 2
# 100

# 出力例 2
# 10000


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    r = int(lines[0])
    # N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = r**2

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['2']
        lines_export = [4]
    if pattern == 2:
        lines_input = ['100']
        lines_export = [10000]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

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:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations, permutations
from copy import deepcopy
import sys
import numpy as np
sys.setrecursionlimit(4100000)



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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())

print(r*r)

Submission status: Accepted

Solution code:
N = int(input())

print(int((N * N * 3) / 3))

Submission status: Accepted

Solution code:
r = int(input())

print(int(r ** 2))

Submission status: Accepted

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

if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

if not ( 1 <= r <= 100 ): sys.exit()

print(r**2)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
r = int(input())
print(r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(int(r**2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = int(input())
print(round((line * line * 3.14) / (1 * 1 * 3.14)))

Submission status: Accepted

Solution code:
import math
line = int(input())
print(round((line * line * 3.14) / (1 * 1 * 3.14)))

Submission status: Accepted

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

import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
INF = float("inf")

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

def cirCle(r: int):
 ans = r ** 2
 print(ans)
 return()


if __name__ == '__main__':
  args = input()
  cirCle(int(args))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

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

    print(r**2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
radius = int(input())

print(int(radius ** 2))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(r*r)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    r = int(readline())
    print(r * r)
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r = int(input())

ans = int(r ** 2)

print(ans)

Submission status: Accepted

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

r = int(input())

print(r ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

    # 半径１の面積 = 1 * 1 * pi
    # 半径ｒの面積 = r * r * pi
    # 半径 r の円の面積が半径 1 の円の面積の何倍になるか = (r*r*pi)/(1*1*pi) = r * r

    print(r*r)

Submission status: Accepted

Solution code:
import os, sys, re, math

r = int(input())

print(r * r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#<ABC.145>
#<A>
import math
r = int(input())
print(r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(500005)
stdin = sys.stdin

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

r = ni()
print(r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 145 A

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print((r**2)//1)

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:
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") # 無限

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Circle
https://atcoder.jp/contests/abc145/tasks/abc145_a

"""
import sys


def solve(r):
    return r ** 2


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


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

Submission status: Accepted

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

ans = r**2
print(ans)

Submission status: Accepted

Solution code:
# mathモジュールをインポート
import math

# 円の面積を求める関数
def circle(r):
  return r*r*math.pi

r = input().rstrip()
r = int(r)

# 円の面積
r_circle = circle(r)

# 半径1の円の面積
one_r_circle = circle(1)

ans = round(r_circle / one_r_circle)
print(ans)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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:
r = int(input())
# C = [int(i) for i in input().split()]
print(r**2)

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:
import sys
import decimal # 10進法に変換，正確な計算

def input():
    return sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:
a = int(input())

b = a ** 2

print(b)

Submission status: Accepted

Solution code:
import math
a = 1
r = int(input())
b = (r**2)
print(b//a)

Submission status: Accepted

Solution code:
r = int(input())

a = r * r

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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