Problem:


Score : 100 points

Problem Statement

We have A apples and P pieces of apple.

We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.

Find the maximum number of apple pies we can make with what we have now.

Constraints

All values in input are integers.

0 \leq A, P \leq 100

Input

Input is given from Standard Input in the following format:

A P

Output

Print the maximum number of apple pies we can make with what we have.

Sample Input 1

1 3

Sample Output 1

3

We can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.

Sample Input 2

0 1

Sample Output 2

0

We cannot make an apple pie in this case, unfortunately.

Sample Input 3

32 21

Sample Output 3

58



Sample input:
1 3


Sample output:
3

Submission status: Accepted

Solution code:
a, p = map(int,input().split())
p += a * 3
print(p // 2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
kakera =3*A+P
print(kakera//2)

Submission status: Accepted

Solution code:
def resolve():
    A, P = map(int, input().split())

    ans = (A * 3 + P) // 2

    print(ans)


resolve()

Submission status: Accepted

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

p += a*3

print(int(p/2))

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
print((x*3+y)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
result=(p+(a*3)) // 2
print(result)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())

print((3 * A + P) // 2)

Submission status: Accepted

Solution code:
def main():
  num = list(map(int,input().split()))
  print(int((num[0]*3+num[1])/2))

main()

Submission status: Accepted

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

p = p + a*3

print(int(p/2))

Submission status: Accepted

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

a, p = list(map(int, input().split()))

print((a*3+p)//2)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


a, p = LI()
sums = 3 * a + p
print(sums // 2)

Submission status: Accepted

Solution code:
a,p = (int(a) for a in input().split())
print((a*3+p)//2)

Submission status: Accepted

Solution code:
from sys import stdin
def LI(): return list(map(int,stdin.readline().rstrip().split()))

tmp = LI()
a,p = [tmp.pop(0) for _ in range(2)]
ans = int((3*a+p)/2)
print(ans)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
print((A*3 + P)//2)

Submission status: Accepted

Solution code:
a,p=[int(x) for x in input().split()]

c=a*3+p

print(c//2)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
ans = 0
ans += (3 * a + p)// 2
print(ans)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
p = 3*a + p
print(p//2)

Submission status: Accepted

Solution code:
a, p = [int(i) for i in input().split()]
print((3*a+p)//2)

Submission status: Accepted

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


def main():
    a, p = map(int, input().split())
    print((a * 3 + p) // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#A
a, p = map(int, input().split())
print((p + 3*a)//2)

Submission status: Accepted

Solution code:

A, P = map(int, input().split())

print((3*A+P)//2)

Submission status: Accepted

Solution code:
import math
a,p = map(int,input().split())

print(math.floor((a*3+p)/2))

Submission status: Accepted

Solution code:
from math import floor
a, p = map(int, input().split())

print(int(floor((3*a+p)/2)))

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print((x*3+y)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
print(((3*a)+p)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
apple=a*3+p
print(apple//2)

Submission status: Accepted

Solution code:
A,P=map(int,input().split());print((A*3+P)//2)

Submission status: Accepted

Solution code:
import math
a,p = map(int,input().split())
print(math.floor((a*3+p)/2))

Submission status: Accepted

Solution code:
print(eval("3*"+input().replace(" ","+"))//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split());print((a*3+p)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
print( (3*A + P) // 2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())

print((A*3 + P)//2)

Submission status: Accepted

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

print((a*3+p)//2)

Submission status: Accepted

Solution code:
k,n=map(int,input().split())
n+=(k*3)
print(n//2)

Submission status: Accepted

Solution code:
import sys
import math
import itertools
a,p=map(int,input().split())
p+=a*3
print(p//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
print((P + A*3)//2)

Submission status: Accepted

Solution code:
A,P = list(map(int, input().split()))
print( (3*A+P)//2 )

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div
# endregion
A, P = ri_()
print((P + 3 * A) // 2)

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    A, P = map(int, readline().split())
    print((3*A+P)//2)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,p = map(int, input().split())
al = a*3 + p
print(al//2)

Submission status: Accepted

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

ans = (a * 3 + p) // 2
print(ans)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
print((3*a + p)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())

print(((A*3)+P)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
ap=a*3
print((ap+p)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
x=a*3+p
print(x//2)

Submission status: Accepted

Solution code:
def main():
    a, p = map(int, input().split())
    x = p + 3*a
    print(x//2)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
p += a * 3
print(p // 2)

Submission status: Accepted

Solution code:
a, p = list(map(int, input().split()))
# a = list(map(int, input().split()))
#data = [list(map(int, input().split())) for i in range(n)]
# n = int(input())
# n, m = list(map(int, input().split()))
# ab_sorted = sorted(ab, key=lambda x: x[0])
total = a*3+p
ans = total/2
print(int(ans))

Submission status: Accepted

Solution code:
# input
A, P = map(int, input().split())
print((3 * A + P) // 2)

Submission status: Accepted

Solution code:
A,P=map(int, input().split())
print((A*3+P)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
print (int(0.5*(A*3+P)))

Submission status: Accepted

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

print((3*a+b)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
p+=3*a

print(p//2)

Submission status: Accepted

Solution code:
def main():
    A,P=map(int,input().split())
    PieceNum=(A*3)+P
    maxPie=PieceNum//2

    print(maxPie)

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
print((a*3+p)//2)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
p += 3*a
ans = p//2
print(ans)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
print ((p+(a*3))//2)

Submission status: Accepted

Solution code:
from collections import Counter 
from collections import defaultdict
from collections import deque
import math
import itertools
import heapq
import sys
sys.setrecursionlimit(10**6)

#n=int(input())
#n,m=list(map(int,input().split()))
#a=list(map(int,input().split()))
input_list = lambda : list(map(int,input().split()))

a,p=input_list()
print((a*3+p)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
sum=3*a+p
print(sum//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())

print((3*A+P) // 2)

Submission status: Accepted

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

print((3*a+p)//2)

Submission status: Accepted

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

a = A * 3 + P
ans = a // 2
print(ans)

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy
a, p = map(int, input().split())
print((a*3+p)//2)

Submission status: Accepted

Solution code:
a, p = list(map(int, input().split()))
print((3 * a + p) // 2)

Submission status: Accepted

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

print((3*a+p)//2)

Submission status: Accepted

Solution code:
def main():
    A, P = map(int, input().split())
    print((A * 3 + P) // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,P = map(int,input().split())

print((A*3+P)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
print((A * 3 + P) // 2)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

# https://atcoder.jp/contests/abc128/tasks/abc128_a
A, P = read_ints()
print((A * 3 + P) // 2)

Submission status: Accepted

Solution code:
A,P = map(int,input().split())
print((3*A+P)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
print(((A*3)+P)//2)

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
a, p = map(int, input().split())
print((a*3+p)//2)

Submission status: Accepted

Solution code:
A, P = map(int,input().split())
P += A*3
print(P//2)

Submission status: Accepted

Solution code:
def main():
    a, p = map(int, input().split())
    p += a * 3
    print(p // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
p += a * 3
print(p//2)

Submission status: Accepted

Solution code:
A, P = map(int,input().split())
print((A*3+P)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
print((a*3+p)>>1)

Submission status: Accepted

Solution code:
import sys
from collections import Counter
from collections import deque
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

a,p=mp()
print((a*3+p)//2)

Submission status: Accepted

Solution code:
def resolve():
  a, p = map(int, input().split())
  print((3 * a + p) // 2)
  return

if __name__ == "__main__":
  resolve()

Submission status: Accepted

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

total = a*3 + p
print(total//2)

Submission status: Accepted

Solution code:
import sys

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


def resolve():
    a, p = map(int, input().split())
    mate = a * 3 + p
    print(mate // 2)


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import math
A, P = map(int, input().split())

print(math.floor((3*A+P)/2))

Submission status: Accepted

Solution code:
A,P = map(int,input().split())
p = A*3+P
print(p//2)

Submission status: Accepted

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

z = a*3+p
print(z//2)

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
total = p + a*3
print(total//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
b=(3*a+p)//2
print(b)

Submission status: Accepted

Solution code:
def main():
    A, P = map(int, input().split())
    k = 3 * A + P
    print(int(k / 2))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    a, p = map(int, input().split())
    p += a * 3
    print(p // 2)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

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

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

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

#############
# Main Code #
#############

A,P = inputIL()

print((A*3+P)//2)

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
c = (a * 3 + p) // 2
print(c)

Submission status: Accepted

Solution code:
A,P = map(int,input().split())
print(int((A*3 + P)/2))

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
p += a*3
print(p//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split(' '))
print((3 * A + P) // 2)

Submission status: Accepted

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

p += a * 3
print(p//2)

#for i in range(a):
#    p += 3
#print(p//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
print((3*A + P)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
print(int((3*a+p)/2))

Submission status: Accepted

Solution code:
#A
a, p = map(int, input().split())
pease = a * 3 + p
print(pease//2)

Submission status: Accepted

Solution code:
A,P = map(int,input().split())


print(int( ( A * 3 + P ) / 2 ))

Submission status: Accepted

Solution code:
A,P = map(int,input().split())

if ( A * 3 + P ) % 2 == 0:
  print(int( ( A * 3 + P ) / 2 ))
else:
  print( int(( A * 3 + P - 1) / 2 ))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    A, P = map(int, input().split())
    S = A*3 + P
    print(S//2)

if __name__ == '__main__':
    main()

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


a, p = Is()
print((a*3+p)//2)

Submission status: Accepted

Solution code:
def ABC_128_A():
    A,P = map(int, input().split())
    print(int((A*3+P)/2))


if __name__ == '__main__':

    ABC_128_A()

Submission status: Accepted

Solution code:
A,P = map(int, input().split())
print(((3*A)+P)//2)

Submission status: Accepted

Solution code:
A,P=map(int,input().split())
print(((A*3)+P)//2)

Submission status: Accepted

Solution code:
def apple_pie(a, p):

    return (a*3+p)//2
def main():
    a, p = map(int, input().split())
    print(apple_pie(a, p))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,p = map(int,input().split())

print((n*3+p)//2)

Submission status: Accepted

Solution code:
# ABC128A

a, p = map(int, input().split())
print((3 * a + p) // 2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())

ans = (A * 3 + P) //2
print(ans)

Submission status: Accepted

Solution code:
# A - Apple Pie

A, P = map(int, input().split())
print((P + A * 3) // 2)

Submission status: Accepted

Solution code:
A,P = list(map(int,input().split()))
S = A*3 + P
print(S//2)

Submission status: Accepted

Solution code:
#A
a,p = map(int,input().split())

apple = a*3
applepie = (apple+p) // 2

print(applepie)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
p+=a*3
apple_pie=0
while(p>=2):
    p-=2
    apple_pie+=1
print(apple_pie)

Submission status: Accepted

Solution code:
[A,P] = list(map(int,input().split()))

kakera = P + A*3
print(kakera//2)

Submission status: Accepted

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

print((a*3+b)//2)

Submission status: Accepted

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

pieces = p + a*3
apple_pie = pieces / 2
print (int(apple_pie))

Submission status: Accepted

Solution code:
A, P = map(int, input().split())

print((A * 3 + P)//2)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, p = map(int, input().split())
print(((3 * a) + p)// 2)

Submission status: Accepted

Solution code:
A, P = list(map(int,input().split()))
print((A*3+P)//2)

Submission status: Accepted

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

print((3 * A + P) // 2)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
print((3*a+p)//2 )

Submission status: Accepted

Solution code:
A,P = map(int, input().split())
print((A*3+P)//2)

Submission status: Accepted

Solution code:
A,P=map(int,input().split())
P += A*3
print(P//2)

Submission status: Accepted

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

print((a * 3 + p)// 2)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
b+=3*a
print(b//2)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
print(int((a*3 + p)/2))

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
ans = (P + A * 3) // 2
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, p = map(int, input().split())
print((a*3+p)//2)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
a *= 3
p += a
print(p // 2)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(int((a*3+b)/2))

Submission status: Accepted

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

A,P = map(int,input().split())
pieces = A*3+P
print(math.floor(pieces/2))

Submission status: Accepted

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

A, P = map(int, input().split())

print((3*A + P)//2)

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
p += a * 3
print(int(p/2))

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
ans = (a * 3 + p) // 2
print(ans)

Submission status: Accepted

Solution code:
def main():
    a, p = map(int, input().split())
    print((3 * a + p) // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def resolve():
  a, p = map(int, input().split())
  print((a*3+p) // 2)
  return

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
def main():
    A, P = (int(i) for i in input().split())
    print((A*3+P)//2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np
import math

def solve():
    a, p = map(int, input().split())
    print((a*3+p)//2)
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
piece = A * 3 + P
print(piece // 2)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,p=map(int, input().split())
    print((a*3+p)//2)
resolve()

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
print((3*A + P) // 2)

Submission status: Accepted

Solution code:
A,P = map(int,input().split())
n = 3*A+P
print(n//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
piece = P + A * 3
print(piece//2)

Submission status: Accepted

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

a, p = [int(x) for x in input().split()]
p += 3*a
print(p//2)

Submission status: Accepted

Solution code:
a, p = list(map(int, input().split()))
print(((a * 3) + p)//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
P=p+3*a
ans=P//2
print(ans)

Submission status: Accepted

Solution code:
A,P = map(int,input().split())

print((3*A + P)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
apple = A * 3 + P
print(apple // 2)

Submission status: Accepted

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


p += a*3

print(p//2)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
a = a*3
p = p+a
print(p//2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
ans=(3*a+p)//2
print(ans)

Submission status: Accepted

Solution code:
a,p = map(int,input().split())
print((p + a * 3)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())

P = P + A * 3
ans = P // 2
print(ans)

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
p = a * 3 + p
print(p//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
sum = A * 3 + P
print(sum//2)

Submission status: Accepted

Solution code:
A, P = map(int,input().split())

pieces = 3*A+P

print(pieces//2)

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
kakera = 3*a + p
print(kakera//2)

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
a, p = map(int, input().split())
p += 3*a
print(p//2)

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
b = a*3
c = (b+p)//2
print(c)

Submission status: Accepted

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

a *= 3
print((a + p) // 2)

Submission status: Accepted

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

P = a*3 + p
pai = P//2

print(pai)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
t = A * 3 + P
print(t // 2)

Submission status: Accepted

Solution code:

a, p = map(int, input().split())

num = 3*a + p

print(int(num//2))

Submission status: Accepted

Solution code:
A, P = list(map(int,input().split()))
P += A*3
print(P//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
ans = (A * 3 + P) // 2
print(ans)

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


A, P = map(int, input().split())
print((A * 3 + P) // 2)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
ans=(a*3+p)//2
print(ans)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
kake=a*3+p
print(kake//2)

Submission status: Accepted

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

kakera = a * 3 + p

print(kakera // 2)

Submission status: Accepted

Solution code:
import sys
A, P = map(int, input().split())
ans = (3*A + P) // 2
 
print(ans)

Submission status: Accepted

Solution code:
A,P = map(int,input().split())
ans = (3 * A + P) // 2
print(ans)

Submission status: Accepted

Solution code:
a, p = [int(x) for x in input().split()]
print((a * 3 + p) // 2)

Submission status: Accepted

Solution code:
a, p=map(int,input().split())
print((3*a+p)//2)

Submission status: Accepted

Solution code:
import math
x = input().split()
a = int(x[0])
p = int(x[1])
print(math.floor((a * 3 +p) / 2))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A, P = map(int, input().split())

print(int((3*A+P)/2))

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
b = a*3+p
print(b//2)

Submission status: Accepted

Solution code:
A,P=map(int,input().split())
n=3*A+P
print(n//2)

Submission status: Accepted

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

print((a*3+p)//2)

Submission status: Accepted

Solution code:
inp = input()
A = int(inp.split()[0])
P = int(inp.split()[1])
result = int((A*3+P)/2)
print(result)

Submission status: Accepted

Solution code:
a,p=map(int,input().split())
b=a*3+p
c=int(b/2)
print(c)

Submission status: Accepted

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

hahen = a*3 + p
pie = (hahen)//2
print(pie)

Submission status: Accepted

Solution code:
# A - Apple Pie

a, p = map(int, input().split())

print((a*3+p)//2)

Submission status: Accepted

Solution code:
def main():
    A, P = map(int, input().split())
    print((3*A+P)//2)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,p=[int(i)for i in input().split()]
apple=3*a+p
print(apple//2)

Submission status: Accepted

Solution code:
A, P = list(map(int, input().split()))
print((A*3+P)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
parts = A * 3 + P

pie = parts // 2

print(int(pie))

Submission status: Accepted

Solution code:
A,P=map(int,input().split(" "))

B=A*3+P
Ans=B//2

print(Ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ret=(a*3+b)//2
print(ret)

Submission status: Accepted

Solution code:
# AtCoder
A, P = map(int, input().split())
print((A*3+P)//2)

Submission status: Accepted

Solution code:
s = input().split()
a = int(s[0])
p = int(s[1])
all_p = a * 3 + p
apple_pie = int(all_p / 2)
print(apple_pie)

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
print((a*3 + b) //2)