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: Runtime Error

Solution code:
import sys
 
if __name__ == '__manin__':
  
    r=sys.argv[1]
    pie=3.14
    
    area = r^2 * pie
    base_area = 1^1 * pie  
    
    print(int(area/base_area)(

Submission status: Runtime Error

Solution code:
import sys

if __name__ == '__manin__':
  
    input=sys.argv[1]
    
    area = input^2 * 3.14
    base_area = 1^1 * 3.14 
    
    print int(area/base_areaa)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
r = int(str.input())
return r * r

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(1000000)
 
def xgcd(a, b):
    x0, y0, x1, y1 = 1, 0, 0, 1
    while b != 0:
        q, a, b = a // b, b, a % b
        x0, x1 = x1, x0 - q * x1
        y0, y1 = y1, y0 - q * y1
    return a, x0, y0
 
def modinv(a, m):
    g, x, y = xgcd(a, m)
    if g != 1:
        raise Exception('modular inverse does not exist')
    else:
        return x % m
 
def combination(n,r,q):
    if r==0:
        return 1
 
    return ((n*combination(n-1,r-1,q)%q)*modinv(r,q))%q
 
def _input():
    return list(map(int, input().split()))
 
def main():
    i=_input()
    x,y=i[0],i[1]
    if 2*y>=x and 2*x>=y and (2*y-x)%3==0 and (2*x-y)%3==0:
        n=(2*y-x)//3
        m=(2*x-y)//3
        print(int(combination(n+m,min(m,n),1000000007)))
    else:
        print(0)
 
if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
N = input()
S = input()
T = S[0:N/2]
Q=T+T
if S in Q:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
I = [input() for i in range(2)]
sn = int(I[0])
ss = str(I[1])
if sn%2 == 1 :
    A = 'No' 
else:
    sl = int(sn/2) 
    # print(sl)
    if sl >= 2 : 
        H1 = ss[:sl]
        H2 = ss[sl:]
    #     print(H1)
    #     print(H2)
    elif sl == 1 :
        H1 = ss[0]
        H2 = ss[1]
    if  H1 == H2 :
        A = 'Yes'
    else:
        A = 'No'
print(A)

Submission status: Runtime Error

Solution code:
I = [input() for i in range(2)]
sn = int(I[0])
ss = str(I[1])
if sn%2 == 1 :
    A = 'No' 
else:
    sl = int(sn/2) 
    print(sl)
    if sl >= 2 : 
        H1 = ss[:sl]
        H2 = ss[sl:]
    elif sl == 1 :
        H1 = ss[0]
        H2 = ss[1]
    if  H1 == H2 :
        A = 'Yes'
    else:
        A = 'No'
print(A)

Submission status: Runtime Error

Solution code:
I = [input() for i in range(2)]
sn = int(I[0])
ss = str(I[1])
if sn%2 == 1 :
    A = 'No' 
else:
    sl = int(sn/2) 
    print(sl)
    if sl >= 2 : 
        H1 = ss[0:sl]
        H2 = ss[sl:]
        print(H1)
        print(H2)
    elif sl == 1 :
        H1 = ss[0]
        H2 = ss[1]
    if  H1 == H2 :
        A = 'Yes'
    else:
        A = 'No'
print(A)

Submission status: Runtime Error

Solution code:
round(r*r,0)

Submission status: Runtime Error

Solution code:
X,Y=map(int,input().split())
if (X+Y)%3!=0:
  print(0)
  exit()
s=(2*X-Y)//3
t=(2*Y-X)//3
mod=(10**9)+7
up,d=1,1
for i in range(s+t,max(s,t),-1):#(s+t)!/s!t!がやりたい
  up=(up*i)%mod
for i in range(1,min(s,t)+1):
  d=(d*i)%mod
d=pow(d,mod-2,mod)
print((up*d)%mod)

Submission status: Runtime Error

Solution code:
circle_1 = 1 * 1 * 3.16

if r < 1 or r > 100:
  False
else:
  circle_r = r * r * 3.16
  return circle_r / circle_1

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv[1]
args = int(args)
print(args*args)

Submission status: Runtime Error

Solution code:
args = sys.argv[1]
print(args*args)

Submission status: Runtime Error

Solution code:
print 4

Submission status: Runtime Error

Solution code:
import itertools
import numpy as np

N = int(input())

x_y_list = []
for i in range(N):
    x, y = list(map(int, input().split()))
    x_y_list.append((x, y))

average_distance = 0
count = 0
for v in itertools.permutations(x_y_list, N):
    dis = [np.sqrt((v[i][0] - v[i + 1][0])**2 + (v[i][1] - v[i + 1][1])**2) for i in range(N - 1)]
    average_distance += sum(dis)
    count += 1

print('{:.10f}'.format(average_distance / count))

Submission status: Runtime Error

Solution code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():

    def fur(n,r):
        p,q = 1,1
        for i in range(r):
            p = p*(n-i)%mod
            q = q*(i+1)%mod
        return p * pow(q,mod-2,mod) % mod

    x, y = nm()

    if (x + y) % 3 != 0:
        print(0)
        exit()
    
    n = (2*y - x) // 3 # (X, Y) -> (X+1, Y+2) 
    m = (2*x - y) // 3 # (X, Y) -> (X+2, Y+1) 

    if n < 0 or m < 0:
        print(0)
        exit()

    print(fur(n+m, n))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
r

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x,y=map(int,input().split())
def cal(number,mod):
    m=mod-2
    mod2=""
    while m!=0:
        if m%2==0:
            mod2="0"+mod2
        else:
            mod2="1"+mod2
        m=m//2
    two=[]
    for i in range(len(mod2)):
        if mod2[len(mod2)-1-i]=="1":
            two.append(i)
    ret=1
    for i in two:
        v=i
        retsub=number
        while v>0:
            retsub=retsub**2
            retsub=retsub%mod
            v-=1
        ret*=retsub
    ret=ret%mod
    return ret
ans=0
M=10**9+7
if (2*x-y)%3==0:
    n=(x+y)//3
    r=(2*x-y)//3
    if n<r:
        print(0)
        exit()
    l=[1]
    num=1
    for i in range(1,n+1):
        p=(num*i)%(M)
        l.append(p)
        num=p
    a=l[n]
    b=cal(l[n-r],M)
    c=cal(l[r],M)
    ans=(a*b*c)%M
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = r*r

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x=r^2/1
print(X)

Submission status: Runtime Error

Solution code:
import math

n = int(input())

x = []
y = []
sum = 0

#座標入力
for i in range(n):
	a, b = map(int, input().split())
	x.append(a)
	y.append(b)

#距離の総和
for i in range(n):
	for j in range(n):
		num = math.factorial(n-1)									
		dist = ((x[i-1]-x[j-1])^2+(y[i-1]-y[j-1])^2)**0.5
		sum+= num*dist

print(sum/math.factorial(n))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(r * r)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
radius = input()

print(radius * radius)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X, Y = map(int, input().split())
n = (2 * X - Y) / 3
m = (2 * Y - X) / 3

if n < 0 or m < 0 or not n.is_integer() or not m.is_integer():
    print(0)
    exit()

MOD = 10**9 + 7
class ModInt:
    def __init__(self, x):
        self.x = x % MOD

    def __str__(self):
        return str(self.x)

    __repr__ = __str__

    def __add__(self, other):
        return (
            ModInt(self.x + other.x) if isinstance(other, ModInt) else
            ModInt(self.x + other)
        )

    def __sub__(self, other):
        return (
            ModInt(self.x - other.x) if isinstance(other, ModInt) else
            ModInt(self.x - other)
        )

    def __mul__(self, other):
        return (
            ModInt(self.x * other.x) if isinstance(other, ModInt) else
            ModInt(self.x * other)
        )

    def __truediv__(self, other):
        return (
            ModInt(
                self.x * pow(other.x, MOD - 2, MOD)
            ) if isinstance(other, ModInt) else
            ModInt(self.x * pow(other, MOD - 2, MOD))
        )

    def __pow__(self, other):
        return (
            ModInt(pow(self.x, other.x, MOD)) if isinstance(other, ModInt) else
            ModInt(pow(self.x, other, MOD))
        )

    __radd__ = __add__

    def __rsub__(self, other):
        return (
            ModInt(other.x - self.x) if isinstance(other, ModInt) else
            ModInt(other - self.x)
        )

    __rmul__ = __mul__

    def __rtruediv__(self, other):
        return (
            ModInt(
                other.x * pow(self.x, MOD - 2, MOD)
            ) if isinstance(other, ModInt) else
            ModInt(other * pow(self.x, MOD - 2, MOD))
        )

    def __rpow__(self, other):
        return (
            ModInt(pow(other.x, self.x, MOD)) if isinstance(other, ModInt) else
            ModInt(pow(other, self.x, MOD))
        )

n, m = map(int, [n, m])
fact = [ModInt(1)]
for i in range(1, X + Y + 1):
    fact.append(fact[i-1] * i)

def cmb(n, r):
    return fact[n] / fact[n-r] / fact[r]

print(cmb(n+m, min(n, m)))

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
print('YNeos'[S[:N//2]!=S[-N//2:]::2])

Submission status: Runtime Error

Solution code:
n=int(input())
s=input()
if n%2!=0:
  print("No")
else:
  if s[:int(n/2)]==s[int(n/2):]:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
s=input()
if n%2!=0:
  print("No")
else:
  if s[:int(n//2)]==s[int(n//2):]:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
s=input()
if n%2!=0:
  print("No")
else:
  if s[:n//2]==s[n//2:]:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
if N%" == 1:
	print("NO")
else:
  if (S[0: int(N/2)] == S[int(N/2):N]):
    print("YES")
  else:
    print("NO")

Submission status: Runtime Error

Solution code:
def hankei(x):
  print(x**2)
print(r)

Submission status: Runtime Error

Solution code:
2rπ/2π

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())

if a<10 & b<10:
    print(a*b)
else:
    print(-1)

Submission status: Runtime Error

Solution code:
import math
def distance(x1,x2,y1,y2):
  d=math.sqrt((x1-x2)**2+(y1-y2)**2)
  return d
count=int(input())
zahyou=[]
for i in range(count):
  a=input().split(" ")
  zahyou.append(a)

lenth=0
for i in zahyou:
  for j in zahyou:
    lenth=lenth+distance(int(i[0]),int(j[0]),int(i[1]),int(j[1]))
print(lenth/count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

r = input()
print(r * r)

Submission status: Runtime Error

Solution code:
import sys

r = input()
print (r * r)

Submission status: Runtime Error

Solution code:
import sys

radius = input()
print (radius * radius)

Submission status: Runtime Error

Solution code:
import sys

radius = sys.argv[0]
print (radius * radius)

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
if a<10 and b<10:
  print(a*b)
else:
  print('-1')

Submission status: Runtime Error

Solution code:

# 入力の取得(空白を除く)
s = list(input().split())

# 処理
isPoor = False
if s[0] == s[1] and s[1] != s[2]:
  isPoor = True
if s[1] == s[2] and s[2] != s[0]:
    isPoor = True
if s[2] == s[0] and s[0] != s[1]:
    isPoor = True

if isPoor:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:

    # 入力の取得(空白を除く)
    s = list(input().split())

    # 処理
    isPoor = False
    if s[0] == s[1] and s[1] != s[2]:
        isPoor = True
    if s[1] == s[2] and s[2] != s[0]:
        isPoor = True
    if s[2] == s[0] and s[0] != s[1]:
        isPoor = True

    if isPoor:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
v = len(s)//2

count = 0

for i in range(v):
    if s[i] == s[len(s) - i - 1]:
        count += 1
if count >= v:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
v = len(s)//2

count = 0

for i in range(v):
    if s[i] == s[len(s) - i - 1]:
        count += 1
if count == v:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

# l = []
# for i in xrange(41):
#     l.append(map(int,raw_input().split()))
# print l

Submission status: Runtime Error

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

if a >= 10 or b >= 10:
  print(-1)
else:
  print(a*b)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
r = int(input)

return r^2

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
int circle(r) {
  int r;
  return r*r;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
1<=r<=100
r*2

Submission status: Runtime Error

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

N = int(input())
x = []
y = []

for i in range(N):
    p, q = map(int, input().split())
    x.append(p)
    y.append(q)

ans = 0

for i in range(N):
    for j in range(N):
        if i == j:
            continue
#        print ("i="+str(i)+", j="+str(j))
#        print ("xi="+str(x[i])+", xj="+str(x[j]))
#        print ("yi="+str(y[i])+", yj="+str(y[j]))
        ans += math.sqrt((x[i]-x[j])**2+(y[i]-y[j])**2)

ans = ans / N
print (ans)

Submission status: Runtime Error

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

N = int(input())
x = []
y = []

for i in range(N):
    p, q = map(int, input().split())
    x.append(p)
    y.append(q)

ans = 0

for i in range(N):
    for j in range(N):
        print ("i="+str(i)+", j="+str(j))
        print ("xi="+str(x[i])+", xj="+str(x[j]))
        print ("yi="+str(y[i])+", yj="+str(y[j]))
        ans += math.sqrt((x[i]-x[j])**2+(y[i]-y[j])**2)

ans = ans / N
print (ans)

Submission status: Runtime Error

Solution code:
N = int(input())
xy = []
for i in range(N):
    a, b = (int(x) for x in input().split())
    xy.append([a, b])
    
def distance(d, xy, i, j):
    return (
              (xy[i][0] - xy[j][0]) ** 2
            + (xy[i][1] - xy[j][1]) ** 2
        ) ** 0.5
 
import itertools
d = []
l1 = [x for x in range(N)]
for v in itertools.permutations(l1, N):
    l2 = list(v)
    d0 = []
    for c in range(N-1):
        i = l2[c]
        j = l2[c+1]
        d0.append(distance(d, xy, i, j))
    d.append(sum(d0))
 
print(sum(d) / len(d))

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
if max(a,b) <= 9:
    print(int(a * b))

else:
    print(-1)

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
if a >= 10 or b >= 10:
    print(int(a * b))

else:
    print(-1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, S = input().split()
n = int(N)
if n % 2 > 0:
    print('No')
hN = n // 2
if S[:hN] == S[hN:n -1]:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import sys
args = sys.argv
radius = args[0]
print(radius * radius)

Submission status: Runtime Error

Solution code:
return r * r

Submission status: Runtime Error

Solution code:
x = input()

print(x*x)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

r = int(input())

return r * r

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main() {
    int r;
    cin >> r;
    cout << r * r << endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
from sys import stdin

r = stdin.readline().rstrip()

print(r ** 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
temp1 = r
temp2 = temp1 * 2
print(temp2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]

t = 1
for i in range(1, N - 1):
  t *= i

ans = 0
for i in range(N - 1):
  for j in range(i + 1, N):
    x1, y1 = xy[i]
    x2, y2 = xy[j]
    ans += (((x1 - x2) ** 2 + (y1 - y2) ** 2) ** (1 / 2)) * (N - 1) * 2 * t

n = 1
for i in range(1, N + 1):
  n *= i

ans /= n

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

r = int(sys.argv[1])

print(r*r, end="")

Submission status: Runtime Error

Solution code:
import sys

r = int(sys.argv[1])

print(r*r)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
r = int(input())

print((r*r)

Submission status: Runtime Error

Solution code:
import math

pi = math.pi

old = 1 * 1 * pi

new = r * r * pi

result = new / old

print(result)

Submission status: Runtime Error

Solution code:

print (r*r)

Submission status: Runtime Error

Solution code:
r = int(inputs())

print(r*r)

Submission status: Runtime Error

Solution code:
r = input()[0]
print(r**2)

Submission status: Runtime Error

Solution code:
n = int(input())
moji = input()
res = 'Yes'
if n % 2 == 1:
    res = 'No'
else:
    for i in range(int(n/2)):
        if moji[i] != moji[int(n/2)+1]:
            res = 'No'
            break
      
print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

X,Y = map(int,input().split())

if (X + Y) % 3 != 0:
  print(0)
  
else:
  a = Y - (X + Y) // 3
  b = X - (X + Y) // 3
  total = a + b
  m = min(a,b)
  def permod(n, r):
    return (math.factorial(n) // math.factorial(n - r)) % (10 ** 9 + 7)
  
  ans = permod(total,m)
  print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
val= int(input())
return val^2

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if S[:N//2] == S[N//2:]:
 print('Yes')
else:
 print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = str(input())
if S[:N//2] == S[N//2:]:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

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

if N % 2 != 0:
    print('NO')
else:
    num =int( N / 2)
    f = S[0:num]
    if S == f+f:
        print('YES')
    else:
        print('NO')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
 
stat = False
if n%2==0:
    m = n//2
    stat = (s[:m]==s[m:])
if stat:   
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=input()
S=list(input())
 
if len(N)%2!=0:
  print('No')
else:
  if S[:N/2]==S[N/2:]:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
key = 0
 
if N%2 == 1:
  key += 1
else:
  for i in range(N//2):
    if S[i] != S[(N//2)+i]:
      key += 1
    
if key >= 1:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
r = input()

print int(r*r)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n
    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]
    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot
    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])
    return result

def run():
  X, Y = map(int, input().split())
  b = X+Y
  if b%3 != 0:
    print(0)
    exit()
  x = b//3
  if X < x or Y < x:
    print(0)
    exit()
  i = X - x
  if i > x//2:
    i = x - i
  ans = cmb(x, i)
  mod=10**9+7
  print(ans%(mod))
  
if __name__ == '__main__':
  run()

Submission status: Runtime Error

Solution code:
from math import sqrt 
N = int(input())
k = [list(map(int, input().split())) for _ in range(N)]
result = 0
for i in range(N):
    for j in range(N):
        if i != j:
            result += sqrt((k[i][0] - k[j][0]) * (k[i][0] - k[j][0]) + (k[i][1] - k[j][1]) * (k[i][1] - k[j][1]))
print(result / N)

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
S1 = []
for i in range(N // 2):
    S1.append(S[i])

S = S[N // 2 :]
S1 = ''.join(S1)
if S1 == S:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
魔法両面テープ

Submission status: Runtime Error

Solution code:
import math

r=input(int())


print(math.pi*r*r/math.pi)

Submission status: Runtime Error

Solution code:
import math

numofpoints= int(raw_input())
coords=[]
for index in range(numofpoints):
	x,y= map(int, raw_input.split())
    coords.append((x,y))
    
def factorial(n):
  	if n==0:
      return 1
    else:
		return n*factorial(n-1)

ave=0
c=0
for i in range(numofpoints):
  xi=coords[i][0]
  yi=coords[i][0]
	for j in range(i,numofpoints):
    	xj=coords[j][0]
  		yj=coords[j][0]
        	rij = ((xi-xj)**2 + (yi-yj)**2)**0.5
        ave = ave + rij
print sumofnum/math.factorial(numofpoints)

Submission status: Runtime Error

Solution code:
numofpoints= int(raw_input())
coords=[]
for index in range(numofpoints):
	x,y= map(int, raw_input.split())
    coords.append((x,y))
    
def factorial(n):
  	if n==0:
      return 1
    else:
		return n*factorial(n-1)

sumofnum=0
c=0
for i in range(numofpoints):
	for j in range(numofpoints):
    	if i!=j:
        	sumofnum+=((coords[i][0]-coords[j][0])**2+(coords[j][1]-coords[j][1])**2)**5
			c+=1
print "%.10f"%(sumofnum/c)

Submission status: Runtime Error

Solution code:
kkk

Submission status: Runtime Error

Solution code:
hhh

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    int r;

    cin >> r;

	int area = r * r;
  	cout << area;
}

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    int r;

    cin >> r;

  	cout << r * r;

}

Submission status: Runtime Error

Solution code:
fact = [1]
mod = 10**9+7
for i in range(1,10**6 + 1):
    fact.append((fact[-1]*i)%mod)
def ncr(n,r):
    return ((fact[n]) * pow(fact[r],mod-2,mod) * pow(fact[n-r],mod-2,mod))%mod
x,y = map(int,input().split())
a = (2*x - y)//3
b = (2*y -x)//3
ans = 0
if (2*a + b == x) and (2*b + a == y) and a>0 and b>0:
    ans = fact[a+b]*pow(fact[a],mod-2,mod)*pow(fact[b],mod-2,mod)%mod
print(ans%mod)

Submission status: Runtime Error

Solution code:
fact = [1]
mod = 10**9+7
for i in range(1,10**6 + 1):
    fact.append((fact[-1]*i)%mod)
def ncr(n,r):
    return ((fact[n]) * pow(fact[r],mod-2,mod) * pow(fact[n-r],mod-2,mod))%mod
x,y = map(int,input().split())
a = (2*x - y)//3
b = (2*y -x)//3
ans = 0
if (2*a + b == x) and (2*b + a == y) and a>0 and b>0:
    ans = ncr(a+b,b)
if (x+y)%3 !=0 or min(a,b)<0:
    print(0)
else:
    print(ans%mod)

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
a = []
x = []
y = []
count = 0

def factorial(n):
    if n<2:
        return 1
    else:
        return(n*factorial(n-1))

for i in range(N):
    a.append(list(map(int,input().split())))    
for i in range(N):
    for j in range(N):
        if i==j:
            continue
        count += np.sqrt((a[i][0] - a[j][0])**2 + (a[i][1] - a[j][1])**2)
b = factorial(N)
#print(count/b)
print(count/N)

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
a = []
x = []
y = []
count = 0

def factorial(n):
    if n<2:
        return 1
    else:
        return(n*factorial(n-1))

for i in range(N):
    a.append(list(map(int,input().split())))    
for i in range(N):
    for j in range(N):
        if i==j:
            continue
        count += np.sqrt((a[i][0] - a[j][0])**2 + (a[i][1] - a[j][1])**2)
b = factorial(N)
print(count/b)
#print(count/N)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if n % 2 == 1:
    print("No")
else:
    s_1 = s[:n/2]
    s_2 = s[n/2:n]
    if s_1 != s_2:
        print("No")
    else:
        print("Yes")

Submission status: Runtime Error

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

if n % 2 == 1:
    print("No")
else:
    s_1 = s[:int(len(s)/2)]
    s_2 = s[int(len(s)/2):n]

    if s_1 != s_2:
        print("No")
    else:
        print("Yes")

Submission status: Runtime Error

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

if n % 2 == 1:
    print("No")
else:
    s_1 = s[:int(n/2)]
    s_2 = s[int(n/2):n]

    if s_1 != s_2:
        print("No")
    else:
        print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

S = r * r * math.pi
fraction = S / (1 * 1 * math.pi)

print(fractions)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())

print(a**)

Submission status: Runtime Error

Solution code:
a = input()

print(a**)

Submission status: Runtime Error

Solution code:
input()**2

Submission status: Runtime Error

Solution code:
s = int(input())

print(int(x*x))

Submission status: Runtime Error

Solution code:
s = input()

print(x*x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import itertools
import numpy as np

num = int(input())
x = []
y = []
for i in range(num):
  x_N, y_N = map(int, input().split())
  x.append(x_N)
  y.append(y_N)

index = [str(i) for i in range(num)]
index_permut = list(itertools.permutations(index))

distance_all = 0
for l in index_permut:
  distance = 0
  index = list(map(int, l))

  for pos in range(num-1):
    x_diff = (x[index[pos+1]] - x[index[pos]]) ** 2
    y_diff = (y[index[pos+1]] - y[index[pos]]) ** 2
    distance += np.sqrt(x_diff + y_diff)

  distance_all += distance
res = distance_all / len(index_permut)
print(res)

Submission status: Runtime Error

Solution code:

print(r**2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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