Problem:


Score : 100 points

Problem Statement

It is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.

Given an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.

Constraints

1 \leq r \leq 100

r is an integer.

Input

Input is given from Standard Input in the following format:

r

Output

Print an integer representing the area of the regular dodecagon.

Sample Input 1

4

Sample Output 1

48

The area of the regular dodecagon is 3 \times 4^2 = 48.

Sample Input 2

15

Sample Output 2

675

Sample Input 3

80

Sample Output 3

19200



Sample input:
4


Sample output:
48

Submission status: Accepted

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

radius = int(radius)

S = 3 * radius *radius

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import io
import sys


def IN_S():
  return input()


def IN_I():
  return int(input())


def IN_L_I():
  return list(map(int, input().split()))


def IN_L_S():
  return list(map(str, input().split()))


def STR_SPLIT(s, n):
  for l in range(0, len(s), n):
    yield s[0 + l:n + l]


def T_IN():
  global test_str
  sys.stdin = io.StringIO(test_str[1:-1])


test_str = '''
80
'''


def MAIN():
  # T_IN()
  A()


def A():
  r = IN_I()
  print (3 * r * r)
  return None
 

def B():
  return None


def C():
  return None


MAIN()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs,math
sys.setrecursionlimit(100000)
Max = sys.maxsize
def l(): #intのlist
	return list(map(int,input().split()))
def m(): #複数文字
	return map(int,input().split())
def onem(): #Nとかの取得
	return int(input())
def s(x): #圧縮
	a = []
	aa = x[0]
	su = 1
	for i in range(len(x)-1):
		if aa == x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x): #listをスペースごとに分ける
	return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
	return max(map(max,x))

n = onem()

print(3 * n* n)

Submission status: Accepted

Solution code:
r = int(input())

ans = 3 * r * r
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3 * (pow(r, 2)))

Submission status: Accepted

Solution code:
#coding : utf-8

import os
import sys

r = int(input())

print(3 * r * r)

Submission status: Accepted

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

Submission status: Accepted

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

    print(3 * r ** 2)

    return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
r = int(input())

s = 3 * (r ** 2)

print(s)

Submission status: Accepted

Solution code:
r = int(input())

print(3*(r**2))

Submission status: Accepted

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


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
r = int(input())

a = r
ans = 3 * a * a
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

r = int(stdin.readline())

print(3*r**2)

Submission status: Accepted

Solution code:
r = int(input())

s = 3*r*r

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#半径 a の円に内接する正十二角形の面積は 3a2であることが知られています。
#整数 r が与えられるので、半径 r の円に内接する正十二角形の面積を求めて下さい。

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
import math



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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

r = int(input())

ans = 3 * r * r

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

print(3 * r * r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
#input = raw_input

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

Submission status: Accepted

Solution code:
import sys

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

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
radius = int(input())

print(3 * (radius ** 2))
exit(0)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def li():
    return list(map(int, input().split()))


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

Submission status: Accepted

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

import sys

n = int(input())
ans = 3 * n * n
print(ans)

Submission status: Accepted

Solution code:
n = int(input())


a = 3*(n**2)
print(a)

Submission status: Accepted

Solution code:
# ABC 134, A -

a = int(input())

print(3 * a**2)

Submission status: Accepted

Solution code:
r = int(input())

print(int(3 * r ** 2))

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [r] = [int(input_raw[0])]
    print 3 * r * r

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np

r = input()
r = int(r)

print(3*r*r)

Submission status: Accepted

Solution code:
r = int(input())

print(3 * (r**2))

Submission status: Accepted

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

print(3*r*r)

Submission status: Accepted

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


main()

Submission status: Accepted

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

print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

r = input()

print(3*int(r)**2)

Submission status: Accepted

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

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]


    token = lines[0].split()
    r = int(token[0])

    return (r,)


def solve(r,):

    return 3 * r * r




def main():
    # 出力

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

Submission status: Accepted

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

r = int(input())

print(3*r*r)

Submission status: Accepted

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

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

    print(3 * r * r)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect
import heapq

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

"""
N, X = map(int, input().split())

x = list(map(int, input().split()))

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

#Distance Transformation
    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""


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

    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8

r =  int(input())

print(3 * r * r)

Submission status: Accepted

Solution code:
r = int(input())

answer = 3*r*r

print(answer)

Submission status: Accepted

Solution code:


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

Submission status: Accepted

Solution code:

R = int(input())
print(3*(R**2))

Submission status: Accepted

Solution code:
r=int(input())     

R=3*r**2
print(R)

Submission status: Accepted

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


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


# Generated by 1.1.4 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:
#A
r = int(input())
print(3*r**2)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,heapq,math,resource
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

def setrlim():
  sys.setrecursionlimit(250000)
  soft,hard = resource.getrlimit(RLIMIT_STACK)
  # setrlimit works on ubuntu (and atcoder), but not on WSL
  #resource.setrlimit(RLIMIT_STACK, (128*1024*1024,hard))

r = inn()
print(3*r*r)

Submission status: Accepted

Solution code:
r = int(input())

area = 3 * r**2

print(area)

Submission status: Accepted

Solution code:
r = int(input())

print("{}".format(3 * r**2))

Submission status: Accepted

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



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

Submission status: Accepted

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


def solve(r: int):
    print(3 * (r ** 2))
    return


# Generated by 1.1.4 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:
import collections as c
ip = lambda : map(int, input().split())
# ##############
mod = 1e9+7
r = int(input())
print(3*r*r)

Submission status: Accepted

Solution code:
from sys import stdin

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

input = lambda: stdin.readline()
main()

Submission status: Accepted

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

print(3 * (r ** 2))

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
 
    a = int(input())
 

    print(3 * a ** 2)
 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

print(3*N*N)

Submission status: Accepted

Solution code:
a = int(input())

anser = 3 * a * a

print(anser)

Submission status: Accepted

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

a = int(input())

print(3*pow(a,2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Jul 20 20:49:09 2019

@author: ctiuser
"""

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

Submission status: Accepted

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

Submission status: Accepted

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

r = int(input())

print(3*r**2)

Submission status: Accepted

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

r = int(input())

print(3*r*r)

Submission status: Accepted

Solution code:
r = int(input())

s = 3*(r**2)
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

print(int(3 * r ** 2))

Submission status: Accepted

Solution code:
r, = (int(x) for x in input().split())
print(r*r*3)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
print(3*(a[0]**2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    r = [int(x) for x in sys.stdin.readline().split()][0]

    logger.debug('{}'.format(r))

    print(3 * r**2)


if __name__ == "__main__":
    resolve()

# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """4"""
        output = """48"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """15"""
        output = """675"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """80"""
        output = """19200"""
        self.assertIO(input, output)

Submission status: Accepted

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


def solve(r: int):
    print(3*(r**2))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  # type: int
    solve(r)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    r = int(input())
    return 3 * r**2


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

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

Submission status: Accepted

Solution code:
a = int(input())

r = 3*a**2
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:


n = int(raw_input())
print 3*n**2

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import *
import sys
inp = raw_input

def err(s):
    sys.stderr.write('{}\n'.format(s))

def ni():
    return int(inp())

def nl():
    return [int(_) for _ in inp().split()]

r = ni()
print(3*r**2)

Submission status: Accepted

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

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

Submission status: Accepted

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

A = int(input())

print(3*A**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))

r = getN()

print(3 * r * r)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

debug = True
#debug = False

def dprint(*objects):
    if debug == True:
        print(*objects)

def solve():
    a = II()
    print(3*a*a)
    pass
solve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
a=int(input())
print(3*a*a)

Submission status: Accepted

Solution code:
import numpy as np
r = int(input())
print(3*r**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import sys

# S = input()
# N, A ,B = map(int, input().split())
A = int(input())

print(3*A*A)

Submission status: Accepted

Solution code:
n=int(input())

n=n*n*3
print(n)

Submission status: Accepted

Solution code:
import sys
import numpy as np
from scipy.misc import comb
sys.setrecursionlimit(1000000)
 
r = int(input())

print(int(3*r**2))

Submission status: Accepted

Solution code:
r = int(input())

print (3*r*r)

Submission status: Accepted

Solution code:
words = lambda t : list(map(t, input().split()))
r = int(input())

print(3 * (r**2))

Submission status: Accepted

Solution code:
import numpy as np

r = int(input())  

print(3 * r**2)

Submission status: Accepted

Solution code:
r = int(input())

print("{}".format(3*r**2))

Submission status: Accepted

Solution code:
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")
#logging.disable(logging.CRITICAL)

def main():
    N = int(input())
    print(N * N * 3)

    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

r = int(readline())

print(3 * r**2)

Submission status: Accepted

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

print( 3 * (r**2) )

Submission status: Accepted

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

import sys
import math
#from pprint import pprint
#import numpy as np
def myinput_int():
    return list(map(int, input().split()))
def myinput_str():
    return list(input().split())

N = myinput_int()[0]

print(3*N*N)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

print(3*n*n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

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

Submission status: Accepted

Solution code:
a = int(input())

print(3 * a**2)

Submission status: Accepted

Solution code:
import numpy as np
from collections import defaultdict
from heapq import heappush, heappop


def djkstra_adj_list(adj_list, src):
    dist = defaultdict(lambda: np.inf)
    dist[src] = 0

    prev = defaultdict(lambda: None)

    queue = []
    heappush(queue, (dist[src], src))

    while len(queue) > 0:
        dist_u, u = heappop(queue)
        vs = adj_list[u]
        for v, weight in vs:
            alt = dist_u + weight
            if alt < dist[v]:
                dist[v] = alt
                prev[v] = u
                heappush(queue, (alt, v))

    return dist, prev


def djkstra_adj_mat(adj_mat, src):
    dist = defaultdict(lambda: np.inf)
    dist[src] = 0

    prev = defaultdict(lambda: None)

    queue = []
    heappush(queue, (dist[src], src))

    while len(queue) > 0:
        dist_u, u = heappop(queue)
        vs = np.argwhere(adj_mat[u] > 0).flatten()
        for v in vs:
            weight = adj_mat[u, v]
            alt = dist_u + weight
            if alt < dist[v]:
                dist[v] = alt
                prev[v] = u
                heappush(queue, (alt, v))

    return dist, prev


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import fractions
from collections import deque
import numbers as np
import math


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:





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

    print(N**2 * 3)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 
import math
import sys
import itertools
import numpy as np

# いっこ入力
r =int(input())

print(r*r*3)

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(100000)

def intinput(): return map(int,sys.stdin.readline().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

import sys

sys.setrecursionlimit(10**7)

# Override `input` function because `stdin.readline()` is 10x faster than built-in `input()`
input = sys.stdin.readline


def read_h(typ=int):
    return list(map(typ, input().split()))


def read_v(n, m=1, typ=int):
    return [read_h(typ) if m > 1 else typ(input()) for _ in range(n)]


def main():
    r, = read_h()
    print(3 * r**2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())

ans = int(3 * (a * a))
print(ans)

Submission status: Accepted

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



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