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:
r = input("")
r = int(r)

ans = 3*r*r
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
def main():
    print( int(input())**2*3)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    A = int(input())
    print(3*(A*A))

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

r=INT()

print(3*r**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, math, itertools, bisect, copy, re
from collections import Counter, deque, defaultdict

# from itertools import accumulate, permutations, combinations, takewhile, compress, cycle
# from functools import reduce
# from math import ceil, floor, log10, log2, factorial
# from pprint import pprint

INF = float('inf')
MOD = 10 ** 9 + 7
EPS = 10 ** -7
sys.setrecursionlimit(1000000)

# N = int(input())
# N,M = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]
# A = [int(input()) for _ in range(N)]
# DP = [[0] * 100 for _ in range(100)]
# DP = defaultdict(lambda: float('inf'))


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

pass

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3 * r ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

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:
r = int(input())
print("%d" % (3*r*r))

Submission status: Accepted

Solution code:
a = input()
a = int(a)
print("{}".format(3*a*a))

Submission status: Accepted

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

import sys
import copy

sys.setrecursionlimit(1000000)

# input = sys.stdin.readline
from collections import defaultdict

# ~~~~~~~~~~~~~~~~~~~~~_(＾～＾ ｣ ∠)_~~~~~~~~~~~~~~~~~~~~~

r = int(input())

print(3 * r * r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC133-A
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
r=I()
print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def menseki(x):
    return 3*x**2

print(menseki(int(input())))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
try:
    r = int(input())
    print(r*r*3)
except ValueError:
    print("mistaking input")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(3*r*r)

Submission status: Accepted

Solution code:
def main():
	import sys
	input = sys.stdin.readline
	r = int(input())
	print(3*r**2)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

S = 3*a*a

print(S)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# スペース区切りの整数の入力
b = a ** 2 * 3
# 出力
print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

r = SORO_INT()
x = 3*r*r
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left, bisect_right, insort_left, insort_right
from operator import itemgetter as ig
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20; INF = float("INF"); ans = 0; tmp = 0; ansli = []; tmpli = []; candili = []
eps = 1.0 / 10 ** 10; mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]; ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]; ddn9 = ddn + [(0, 0)]
"""for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:"""
def wi(): return list(map(int, sys.stdin.readline().split()))
def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]#WideIntPoint
def ws(): return sys.stdin.readline().split()
def i(): return int(sys.stdin.readline())
def s(): return input()
def hi(n): return [i() for _ in range(n)]
def hs(n): return [s() for _ in range(n)]#HeightString
def mi(n): return [wi() for _ in range(n)]#MatrixInt
def mip(n): return [wip() for _ in range(n)]
def ms(n): return [ws() for _ in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

print(int(3 * (int(stdin.readline().rstrip()) ** 2)))

Submission status: Accepted

Solution code:
A = int(input())

print(3*A**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A
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:
num = int(input())
print(3 * num * num)

Submission status: Accepted

Solution code:
#A
n = int(input())
print(3*n**2)
#B
#n, d = map(int, input().split())
#canseerange = 2*d+1
#if n % canseerange == 0:
#    print(int(n/canseerange))
#else:
#    print(int(n/canseerange)+1
#C
#n = int(input())
#ans = 0
#most1 = 0
#most2 = 0
#ed = False
#for i in range(n):
#    t = int(input())
#    ed = False
#    if most1 <= t:
#        most2 = most1
#        most1 = t
#        ans = i
#        ed = True
#    elif most2 <= t and ed == False:
#        most2 = t
#for i in range(n):
#    if i==ans:print(most2)
#    else:print(most1)
#D

Submission status: Accepted

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

Submission status: Accepted

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


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


# 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())

a = 3 * r ** 2

print(a)

Submission status: Accepted

Solution code:
import sys

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


if __name__ == '__main__':
    r = int(sys.stdin.readline().strip())
    print solve(r)

Submission status: Accepted

Solution code:
r=int(input())
print('{0}'.format(3*r*r))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


#r = -1.1

#while r < 1 and r > 100 and isinstance(r, float): 
	
r = input()
	


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    r = int(input().strip())
    return(3 * r * r)

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

Submission status: Accepted

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


if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy
from collections import Counter, deque, defaultdict
import heapq
from functools import reduce
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()
# template

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
  r = int(input())
  solve(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
R = int(input())

print(3*R*R)

Submission status: Accepted

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

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

print(3 * (R ** 2))

Submission status: Accepted

Solution code:
Input =  int(input())

if 1<=Input<=100:
  Result = 3*Input**2

print(Result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


a=int(input())

print(3*(a**2))

Submission status: Accepted

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

Submission status: Accepted

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

    print('{}'.format(r**2*3))
    
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC134-A

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  r=I()
  return 3*r*r

# main()
print(main())

Submission status: Accepted

Solution code:
# 2019/07/20
# AtCoder Beginner Contest 134 - A

# Input
r = int(input())

# Calc
ans = 3 * r ** 2

# Output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = int(input())

print(3 * (n ** 2))

Submission status: Accepted

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

Submission status: Accepted

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

    
main()

Submission status: Accepted

Solution code:
import sys

#+++++
		
def main():
	a = int(input())
	print(3*a*a)
	
	
#+++++

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
	else:
		input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

Solution code:
a = int(input())

print(3 * (a ** 2))

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    r = int(stdin.readline().rstrip())

    print(3*r*r)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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**2)

Submission status: Accepted

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


r = int(input())

print(3 * r * r)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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

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

if  __name__=='__main__':
    main()

Submission status: Accepted

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


def solv(r):
    return r*r*3


if __name__ == '__main__':

    r = int(input())

    ans = solv(r)

    print(ans)

Submission status: Accepted

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

def main():
    # # 整数の入力
    # a = int(input())
    # # スペース区切りの整数の入力
    # b, c = map(int, input().split())
    # # 文字列の入力
    # s = input()
    # # 出力
    # print("{} {}".format(a+b+c, s))
    r = int(input())
    print(3 * r * r)

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

r= int(input())


print(int(np.ceil(np.sin(np.pi/6)*r*r*6)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

from fractions import gcd
from math import ceil,floor
import collections

# n=int(input())
# A,B,C,D=map(int, input().split())
# string = input()
# list = list(map(int, input().split()))


r = int(input())

print(3 * r * r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

result = 3 * r * r

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

print(int(x)*int(x)*3)

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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:
import sys
r = int(sys.stdin.readline().strip())
print(3*r*r)

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 5 + 10)

import math



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

    print(num * num * 3)


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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


print(3*r*r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

print(3 * x ** 2)

Submission status: Accepted

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

def ri():
    return int(input())

def rl():
    return list(input().split())

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

S=3*b**2

print(S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
ans = 3 * (a**2)
# 出力
print(ans)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
from sys import stdin


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

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

print(m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

print(3 * a * a)

Submission status: Accepted

Solution code:

r=int(input())

print(3*r**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np


def main():
	#r = [int(x) for x in input().split()]
	r = int(input())
	print(3*r*r)
	
	
if __name__ == "__main__":
	main()

Submission status: Accepted

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

print(3 * r ** 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

if __name__ == '__main__':
    r = int(stdin.readline().rstrip())
    print(3*r**2)

Submission status: Accepted

Solution code:
r = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ' 'dで区切ってprintする方法
# print(*a, sep=' ')

import math

print(int(math.pow(int(input()),2)*3))

Submission status: Accepted

Solution code:
a = int(input())

print("{}".format(3*a*a))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def Dodecagon(r):
    print(3*r*r);


if __name__ == "__main__":
    a = int(input());
    Dodecagon(a);

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r  = int(input())

print(3 * r * r)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def main():
    r = int(input())
    print(3*r*r)
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(3*pow(i[0], 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
# import bisect
# import math
import numpy as np
# from fractions import gcd
import itertools

"""Template"""


class IP:
    """
    入力を取得するクラス
    """
    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x//y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)

    def lcm(self, x, y):
        return (x * y) // self.gcd(x, y)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e = range, enumerate
    ip = IP()
    id = Idea()
    """この下から書いてね"""
    n = ip.I()
    print(3 * (n**2))



main()

Submission status: Accepted

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

Submission status: Accepted

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

print(3 * r * r)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(Ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

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

Submission status: Accepted

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

r = SORO_INT()
x = 3*r*r
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

s = int(input())

print(3*s*s)

Submission status: Accepted

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

Submission status: Accepted

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

print(3 * a * a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

ans=3*r*r

print(ans)

Submission status: Accepted

Solution code:
r = int(input())

print(3 * r **2)

Submission status: Accepted

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


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

    

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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



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**2)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# input
r = int(input())

# solve & output
print(3 * r**2)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
r = int(input())

ans = 3 * (r** 2)

print(ans)

Submission status: Accepted

Solution code:
import numpy as np

r = int(input())

print(3*r*r)

Submission status: Accepted

Solution code:
def main():
    # A= map(int, input())
    A = int(input())

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


if __name__ == "__main__":
    main()