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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())

print(3*(r**3))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())

print(3*r*r*r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

print(3 * (a * a * a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def dd():
    r=int(input("r="));
    d=3*r*r;
    print(d);
def main():
    dd();
main();

Submission status: Wrong Answer

Solution code:
def dd():
    c=int(input("c="));
    d=3*c*c;
    print(d);
def main():
    dd();
main();

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

b = 3 * (a^2)

print(b)

Submission status: Wrong Answer

Solution code:
r = int(input())

print(int(3*r^2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())

def cal_S(r):
    return r**2

print(cal_S(r))

Submission status: Wrong Answer

Solution code:
r = int(input())

print(3*r^2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input()
b=int(a)
print(b)
if b >= 0 and b <= 100:
  print(3*pow(b,2))

Submission status: Wrong Answer

Solution code:
def dodecagon(r):
    return 3*r^2

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a =  int(input())

print(3*a**a)

Submission status: Wrong Answer

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

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

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

S = int(S)

S = 3 * S**2

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r=int(raw_input())

print 3*r^2

Submission status: Wrong Answer

Solution code:
def main10():
    num = int(input())
    result = num * num * 3
    print(num)

if __name__ == "__main__":
    main10()

Submission status: Wrong Answer

Solution code:
def a(r):
    return 3*r**2

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print("-1")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

S = 3*a^2

print(S)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())

print(3 * r ** r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print(3 * input())

Submission status: Wrong Answer

Solution code:
r  = int(input())

print(4 * r * r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
r = int(input())

print(3*4**2)

Submission status: Wrong Answer

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#ABC134 A

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(3*r**2)

Submission status: Accepted

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

z = 3*r*r
print(z)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
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,pi,factorial
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7
#main code here!
    r=I()
    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:
print(int(int(input())**2*3))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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


def main():
    r = int(readline())
    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:
r = int(input())
x = 3 * r ** 2
print(x)

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

print(main())

Submission status: Accepted

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

    ans = 3 * r ** 2

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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:
i=int(input())
print(3*i**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:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
r = int(input())
print(3*r*r)

Submission status: Accepted

Solution code:
r = int(input())

print(3 * r * r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF =  float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353

r = int(input())

print(3*r**2)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 問題：https://atcoder.jp/contests/abc134/tasks/abc134_a

r = int(input())

area = 3 * r * r

print(area)

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

print(3*(r**2))

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def area(x):
    area = 3 * x * x
    print(area)

area(int(input()))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
r = int(lines.pop(0))
print(3 * r ** 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3 * r * r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))


n = int(input())

print(3*n**2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(3*(r**2))

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():

    r = int(input())

    ans = 3 * r ** 2

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# A - Dodecagon /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

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

# 制約
#     1≦r≦100
#     rは整数である。

# 入力
# 入力は以下の形式で標準入力から与えられます。
# r

# 出力
# 正十二角形の面積を表す整数を出力してください。

# 入力例 1
# 4

# 出力例 1
# 48

# 正十二角形の面積は 3×42=48です。

# 入力例 2
# 15

# 出力例 2
# 675

# 入力例 3
# 80

# 出力例 3
# 19200


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    r = int(lines[0])
    # X, A = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(6):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(M):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = 3 * r**2

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['4']
        lines_export = [48]
    if pattern == 2:
        lines_input = ['15']
        lines_export = [675]
    if pattern == 3:
        lines_input = ['80']
        lines_export = [19200]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

print(r**2 * 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): #xは64bit整数
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reverse=True)  #二個目の要素で降順並び替え

    N = int(input())
    #N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    print(3*N**2)





if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(eval("3*"+input()+"**2"))

Submission status: Accepted

Solution code:
import sys
import math

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if not ( 1 <= r <= 100 ): sys.exit()

print(3*(r**2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, math
from collections import defaultdict
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

r = ri()

print(3*r**2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#create date: 2020-07-07 10:59

import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    r = I()

    print(3 * r ** 2)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
# from collections import Counter
n = int(input())
# li = list(map(int, input().split()))
# n, a, b = map(int, input().split())
print(3*n**2)

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

Submission status: Accepted

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

    
if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
r = int(input())

menseki = 3 * r * r

print(menseki)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
r = int(input())
print(3*r*r)

Submission status: Accepted

Solution code:
radius = int(input())

print(int(3 * radius **2))

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = int(input())

area = 3*r**2

print(area)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

print(3*(n**2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

Submission status: Accepted

Solution code:
r = int(input())

print(r*r*3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    r = int(readline())
    print(3 * r * r)
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 134 A

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

Submission status: Accepted

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