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 Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
from heapq import heappop, heappush
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7

def inp(): # n=1
    return int(input())
def inpm(): # x=1,y=2
    return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
    return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
    return list(input().split())
def inplm(n): # x=[] 複数行
    return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
    return sorted([list(map(int, input().split())) for _ in range(n)])
def sortx(x,n,k):
    if k == 0:x.sort(key=lambda y:y[1,n])
    else:x.sort(reversed=True, key=lambda y:y[1,n])
def graph():
    n=inp()
    g=[[] for _ in range(n)]
    for i in range(n):
        a=inp()
        a-=1
        g[i].append(a)
        g[a].append(i)
    return n,g
def graphm():
    n,m=inpm()
    g=[[] for _ in range(n)]
    for _ in range(m):
        a,b,w=inpm()
        a-=1
        b-=1
        g[a].append((b,w))
        g[b].append((a,w))
    return n,m,g

def dijkstra(s,n,g): # sからの最短距離 頂点数n
    s -= 1
    que = []
    d = [10**15 for _ in range(n)]
    d[s] = 0
    heappush( que,(0,s) )
    while len(que)>0:
        p =  heappop(que)
        v = p[1]
        if d[v] < p[0]:
            continue
        for i in range(len(g[v])):
            edge = g[v][i]
            if d[edge[0]] > d[v] + edge[1]:
                d[edge[0]] = d[v] + edge[1]
                heappush( que,(d[edge[0]] , edge[0]) )
    return d

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

      
      

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin
import statistics
from math import factorial

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

print(n**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 permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

r = INT()

print(r*r)

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

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
r = int(sys.stdin.readline())
print(int(r**2))

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	r = int(input())
	print(r ** 2)
	


if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)

def main():
  n = ni()
  print(n**2)

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
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)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    r = I()
    print(r**2)
    return

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

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

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n = inp()
print(n**2)

Submission status: Runtime Error

Solution code:
r = int(input("long?"))

return r * r

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import os
f = open('/Users/yuigawada/Desktop/競プロ/Atcoder/input.txt', 'r')
sys.stdin = f

import itertools
import numpy as np
import fractions
from itertools import combinations
from functools import reduce
from functools import lru_cache
import math
from collections import deque
import decimal
import bisect
import heapq
from collections import defaultdict
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: Runtime Error

Solution code:
mod = 10 ** 9 + 7
x, y = [int(i) for i in input().split()]
if (2*x - y) % 3 != 0 or (2*y - x) % 3 != 0:
  print(0)
a = (2*x - y) // 3
b = (2*y - x) // 3
def mygcd(a_b, b, mod):
    b = min(a_b, b)
    cnt = 1
    for i in range(b):
        cnt = cnt * (a_b - i) * pow(i+1, mod-2, mod) % mod
    return cnt
print(mygcd(a+b, b, mod))

Submission status: Runtime Error

Solution code:
a = input()
print(a ^ 2)

Submission status: Runtime Error

Solution code:
import sys
n = int(input())
s = input()
if n % 2 == 1:
  print("No")
  sys.exit()

if s[0://2] == s[n//2:]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
if n % 2 == 1:
  print("No")

if s[0:n/2] == s[n/2:]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
r = input()
r1 = 1

print( r**2 )

Submission status: Runtime Error

Solution code:
uyru

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
r = sys.argv[1]
print(int(r) ** 2)

Submission status: Runtime Error

Solution code:
print(r ** 2)

Submission status: Runtime Error

Solution code:
import sys
print(int(sys.argv[1]) ** 2)

Submission status: Runtime Error

Solution code:
N, A, B, C = map(int,input().split())
ans = []
flag = True
cnt = 0
while True:
  if A < 0 or B < 0 or C < 0:
    flag = False
    break
  cnt += 1
  if cnt > N:
    break
  s = input()
  if s == 'AB':
    if A == B == 1:
      cnt += 1
      if cnt > N:
        ans.append('A')
        break
      else:
        s = input()
        if s == 'AB':
          ans.append('A')
          ans.append('B')
          continue
        elif s == 'AC':
          ans.append('A')
          ans.append('C')
          B -= 1
          C += 1
          continue
        else:
          ans.append('B')
          ans.append('C')
          A -= 1
          C += 1
          continue
    elif A >= B:
      A -= 1
      B += 1
      ans.append('B')
      continue
    else:
      B -= 1
      A += 1
      ans.append('A')
      continue
  elif s == 'BC':
    if B == C == 1:
      cnt += 1
      if cnt > N:
        ans.append('B')
        break
      else:
        s = input()
        if s == 'BC':
          ans.append('B')
          ans.append('C')
          continue
        elif s == 'AB':
          ans.append('B')
          ans.append('A')
          B -= 1
          A += 1
          continue
        else:
          ans.append('C')
          ans.append('A')
          C -= 1
          A += 1
          continue
    elif B >= C:
      B -= 1
      C += 1
      ans.append('C')
      continue
    else:
      C -= 1
      B += 1
      ans.append('B')
      continue 
  else:
    if C == A == 1:
      cnt += 1
      if cnt > N:
        ans.append('C')
        break
      else:
        s = input()
        if s == 'AC':
          ans.append('C')
          ans.append('A')
          continue
        elif s == 'BC':
          ans.append('C')
          ans.append('B')
          A -= 1
          B += 1
          continue
        else:
          ans.append('A')
          ans.append('B')
          C -= 1
          B += 1
          continue
    elif A >= C:
      A -= 1
      C += 1
      ans.append('C')
      continue
    else:
      C -= 1
      A += 1
      ans.append('A')
      continue
if flag:
  print('Yes')
  for item in ans:
    print(item)
else:
  print('No')

Submission status: Runtime Error

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

INF = float('inf')


def solve(N: int, x: "List[int]", y: "List[int]"):
    def distance(x1, y1, x2, y2):
        return np.linalg.norm(np.array([x1, y1]) - np.array([x2, y2]))

    l = [[distance(x[i], y[i], x[j], y[j]) if j >
          i else 0 for j in range(N)] for i in range(N - 1)]

    return np.average([sum(l[r[i]][r[i+1]] if r[i] < r[i+1] else l[r[i+1]][r[i]] for i in range(N-1))
                       for r in its.permutations(range(N))])


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    x = [int()] * (N)  # type: "List[int]"
    y = [int()] * (N)  # type: "List[int]"
    for i in range(N):
        x[i] = int(next(tokens))
        y[i] = int(next(tokens))
    print(f'{solve(N, x, y)}')


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())

if len(n) % 2 == 1:
  print('No')
else:
  a = n[0 : len(n)//2]
  b = n[len(n)//2 : len(n)]
  if a == b:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(r*r)

Submission status: Runtime Error

Solution code:
import math
r=int(input())
area1=pi
arear=pi*pow(r,2)
ratio=int(arear/area1)
print(ratio)

Submission status: Runtime Error

Solution code:
import math
r=int(input())
area1=pi
arear=pi*pow(r,2)
ratio=int(area2/area1)
print(ratio)

Submission status: Runtime Error

Solution code:
def inv(a,p):
    if a==1:
        return 1
    elif a==0:
        return 0
    return p-(inv(p%a,p)*(p//a))%p
x,y=map(int,input().split())
if (x+y)%3!=0:
    print("0")
    exit()
n=(x+y)//3
r=(2*x-y)//3
p=10**9+7
def fact(n,p):
    a=[[] for _ in range(n+1)]
    a[0]=1
    for i in range(n):
        a[i+1]=(a[i]*(i+1))%p
    return a
f=fact(n,p)
if len(f)=<r:
    print("0")
    exit()
c=f[-1]
d=f[r]
e=f[n-r]
dd=inv(d,p)
ee=inv(e,p)
ans=(c*dd*ee)%p
print(ans)

Submission status: Runtime Error

Solution code:
print(r**2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(r*r)

Submission status: Runtime Error

Solution code:
import math

r = int(input('整数r(1<=r<=100)を入力 >>')
arear = r * r * math.pi
area1 = 1 * 1 * math.pi

nanbai = arear / area1
print('半径{}の円の面積は半径1の円の面積の{}倍です',r,nanbai)

Submission status: Runtime Error

Solution code:
import numpy as np

r = input("半径を選択")
r = float(r)

if r < 0 or r > 101:
    print("rは0から100までの整数")
    print("初めからやり直す")

elif r - int(r) != 0:
    print("初めからやり直す")

else:
    ori = (1 **2)
    ans = r**2 / ori
    ans = int(ans)
    print(ans)

input("Enterで終了")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

a, b, c= [int(x) for x in input().split()] 

# Atcoder beginner contest 145. A - Circle

r = int(input())

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

# the answer must be integer, != float
print(int(ans))

Submission status: Runtime Error

Solution code:
rr = r * r
ll = l * l
a = rr / ll

Submission status: Runtime Error

Solution code:
ans=r*r
return ans

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

output = r**2

print(output)

Submission status: Runtime Error

Solution code:
from itertools import permutations
from math import sqrt

n = int(input())
position = [tuple(map(int,input().split())) for _ in range(n)]

def dist_calc(i,j):
  return sqrt(pow(position[i][0]-position[j][0],2)
              +pow(position[i][1]-position[j][1],2))

ans = 0
mean = 0
for tmp in permutations(range(n)):
  for j in range(n-1):
    ans += dist_calc(tmp[j],tmp[j+1])
  mean += 1
print(ans/mean)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
num = input()

return num*num

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l

Submission status: Runtime Error

Solution code:
s1=1**2
s2=r**2
return int(s2/s1)

Submission status: Runtime Error

Solution code:
int(r*r)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(r^2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

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


if __name__ == '__main__':
  args = sys.argv
  cirCle(int(args[1]))

Submission status: Runtime Error

Solution code:
r*r

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# スペース区切りの整数の入力
b, c = map(int, input().split())
# 文字列の入力
s = input()
# 出力
print("{} {}".format(a+b+c, s))

Submission status: Runtime Error

Solution code:
a = int(input())
b,c = map(int, input().split())
s = input()
print("{} {}".format(a+b+c, s))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
r=input("r:")
PI=3.14
s1=(r**2)*PI
print(s1/PI)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
double pi
out = r*r

Submission status: Runtime Error

Solution code:
from itertools import combinations

n = int(input())
D = []
ans = 0
for i in range(n):
    x,y = map(int,input().split())
    D.append((x,y))
for i,j in combinations(range(1,n+1),r=2):
    p,q = D[i-1]
    r,s = D[j-1]
    ans += ((p-r)**2+(q-s)**2)**(0.5)
print(2*ans/n)

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
print("Yes" if N%2 == 0 and S[:N/2] == S[N/2:N])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
r = int(input)

print(int(r**2))

Submission status: Runtime Error

Solution code:
r = int(input)

print(r**2)

Submission status: Runtime Error

Solution code:
def circle(r)
	return r**2

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
print("Yes" if S[:N//2] == S[N//2:] else "No")

Submission status: Runtime Error

Solution code:
r**2

Submission status: Runtime Error

Solution code:
r^2

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print((r * r)(1 * 1))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
T = list()
for i in range(int(N / 2), N):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i, k in zip(T, S):
    if i == k:
        y += 1
    else:
        n += 1
if N % 2 != 0:
    print('No')
elif y == int(N / 2):
    print('Yes') 
else:
    print('No')

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
T = list()
for i in range(int(N / 2), N):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i, k in zip(T, S):
    if i == k:
        y += 1
    else:
        n += 1
if y == int(N / 2):
    print('Yes') 
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
print("Yes" if S[:N//2] == S[N//2:] else "No")

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
print("Yes" if S[:(N//2)+1:] == S[(N//2)+1::] else "No")

Submission status: Runtime Error

Solution code:







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

Submission status: Runtime Error

Solution code:




a=









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

Submission status: Runtime Error

Solution code:
z=r*r
print z

Submission status: Runtime Error

Solution code:
a = input("半径")
print(a*a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
return int(r**2)

Submission status: Runtime Error

Solution code:

return int(radius**2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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