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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
a=sys.stdin.readline()
res=[i for i in a.split()]
r1=float(res[0])
v=r1.is_integer()
if v==True:
    r=int(r1)
    if 1<=r<=100:
        print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3 * (r * r))

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:
def solve():
    print((int(input()) ** 2) * 3)

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
r = int(input())

print(int(3*r*r))

Submission status: Accepted

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

r = int(input())

ans = 3*r**2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    r = int(input())
    res = 3 * pow(r, 2)
    print(res)


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
# A - Dodecagon
# https://atcoder.jp/contests/abc134/tasks/abc134_a

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    print(3 * pow(int(input()), 2))

    return 0

if __name__ == "__main__":
    solve()

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 # (string,3) 3回
#from collections import deque
from collections import defaultdict
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
r = I()
print(3*r**2)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = int(input())

print(A**2*3)

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())

print(3*r*r)

Submission status: Accepted

Solution code:
print 3 * (int(raw_input()) ** 2 )

Submission status: Accepted

Solution code:
r = int(input())

print(r**2 * 3)

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    r = int(input())
    print(3 * r ** 2)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:
import sys


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

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

main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == "__main__":
    print(solve(int(input())))

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc134/tasks/abc134_a

r = int(input())

print(3 * r ** 2)

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    r = I()
    print(3 * r * r)

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  # type: int
    solve(r)


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

print(3*(a ** 2))

Submission status: Accepted

Solution code:
r = int(input())

print(3*r**2)

Submission status: Accepted

Solution code:
r = int(input())

ans = 3 * r * r
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
R = int(input())

print(3*R**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
S =3*r*r
print(S)

Submission status: Accepted

Solution code:
r = int(input())

print(3 * r**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: <encode name> -*-

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def dodecagon(r):

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

    ans = 3 * R * R
    print(ans)
    return


if __name__ == "__main__":
    main()
    sys.exit(0)

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
r = int(input())
print(3*r**2)

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict

geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(input())

print(gete(lambda r: 3 * int(r)**2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    r=ii()
    print(3*r*r)

main()

Submission status: Accepted

Solution code:
# ABC134A

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

Submission status: Accepted

Solution code:
from math import pow
r = int(input())
print(3*int(pow(r, 2)))

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_134_A()

Submission status: Accepted

Solution code:
r = int(input())

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


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

Submission status: Accepted

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


solve()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Dodecagon / 

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

Submission status: Accepted

Solution code:
import sys, heapq, bisect, math, fractions
from collections import deque

r = int(input())

print(3 * r ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N = int(input())
# S = input()
# A, B = map(int, input().split())
# A = list(map(int, input().split()))
print(3 * N * N)

Submission status: Accepted

Solution code:
import sys
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]

print(((ri()) ** 2) * 3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3*r*r)

Submission status: Accepted

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

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

    print(3 * r * r)


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input().strip('\n'))
print(3*r**2)

Submission status: Accepted

Solution code:
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


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

    a = ii()
    print(pow(a,2)*3)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())

print(3*(a**2))

Submission status: Accepted

Solution code:
# A - Dodecagon

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

Submission status: Accepted

Solution code:
N=int(input())

print(3*N*N)

Submission status: Accepted

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

print(3*r**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

r = int(input())

print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Coding:Utf-8

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

Submission status: Accepted

Solution code:
#--Dodecagon

r = int(input())
print(3*r**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 accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()

N, A, B = map(int, input().split())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""
N = int(input())
print(3 * N ** 2)




# def main():

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3 * r **2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

print(3 * a * a)

Submission status: Accepted

Solution code:
r = int(input())

print(r*3*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")



r=II()

print(3*r**2)

Submission status: Accepted

Solution code:
r = int(input())

print(3*pow(r,2))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import math
import collections
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

r=I()
print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

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

Submission status: Accepted

Solution code:
def resolve():

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

resolve()

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc134/tasks/abc134_a

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

Submission status: Accepted

Solution code:
import sys

def solve():
    print(3 * pow(int(input()), 2))
    
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
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 debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def q1():
    """ A - Dodecagon """
    r = int(input())
    print(3 * r**2)


if __name__ == '__main__':
    q1()

Submission status: Accepted

Solution code:
r = int(input())

area = 3 * r ** 2

print(area)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 134: A – Dodecagon
print(3 * int(input()) ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  r = int(readline())
  print(3*(r**2))
  
  
  
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

def main():
    print(3*r**2)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  r = int(input())
  print(3 * (r**2))
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 28 17:31:17 2020

@author: Kanaru Sato
"""

r = int(input())

print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

s = 3 * (r * r)

print(s)

Submission status: Accepted

Solution code:
r = int(input())

print(3 * pow(r,2))

Submission status: Accepted

Solution code:
s=int(input())

print(3*s**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# 入力の受け取り
r = int(input())

ans = 3*r**2

print(ans)
# print("{:.10f}".format(ans))
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

Submission status: Accepted

Solution code:
r = int(input())

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

Submission status: Accepted

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


def solve(r: int):
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    r = int(input())
    print(int(3*(r*r)))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import os, sys, re, math

r = int(input())

print(3 * r * r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3 * (r ** 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    N = int(input())
    return 3*N*N

print(solve())

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Dodecagon
https://atcoder.jp/contests/abc134/tasks/abc134_a

"""
import sys


def solve(r):
    return 3 * 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:
# A
r = int(input())
print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys


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

Submission status: Accepted

Solution code:
# ABC134 A

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

    area = 3 * r * r

    print(area)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Dodecagon
r=int(input())
print(3*(r**2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin

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

print(3*(r**2))

Submission status: Accepted

Solution code:

r = int(input())

print(3 * r ** 2)

Submission status: Accepted

Solution code:
r = int(input())

print(r**2*3)

Submission status: Accepted

Solution code:
a = int(input())

print(3 * (a ** 2))

Submission status: Accepted

Solution code:
import sys
print(3 * pow(int(input()), 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
#import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

ans = 3*r*r
print(ans)

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

Submission status: Accepted

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