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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce

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

a, p = MAP()

print((a*3+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())

i = (3*a + p)/2

print(int(i))

Submission status: Accepted

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

sum_apple = 3 * A + P

print(sum_apple // 2)

Submission status: Accepted

Solution code:
A,P=map(int,input().split())
slice=A*3+P
print(slice//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 = list(map(int, input().split()))
p = p + 3 * a
print(int(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 = [int(i) for i in input().split()]
print((A*3+P)//2)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc128/tasks/abc128_a

a, p = [int(x) for x in input().split()]
print(int((a * 3 + p) / 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 == 0 and P < 2:
	print(0)
else:
	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= input().split(" ")
b = 3 * int(a)
c = (b + int(p)) // 2
print(c)

Submission status: Accepted

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

if __name__ == '__main__':
    resolve()

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())
tmp = 3*a+p
print(tmp//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())

A = A * 3

s = A + P
print(s//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 =P + A*3
print(P//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a, p = map(int, sys.stdin.readline().split())

def main():
    return (3 * a + p) // 2

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

Submission status: Accepted

Solution code:
A, P = [int(s) for s in input().split(' ')]
print((A * 3 + P) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

(A, P) = [int(n) for n in input().split()]

print((A * 3 + 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
# -*- coding: utf-8 -*-


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((P+3*A)//2)

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 = map(int, input().split())

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

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

a = A*3 + P

if a > 0:
  print(int(a/2))
else:
  print(0)

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,b=map(int,input().split())
a=a*3
print((b+a)//2)

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
X = A * 3 + P
print(X//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 = 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:
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())
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())
n = 3 * a + p
print(n // 2)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def LI():
  return [int(s) for s in input().split()]

A,P = LI()

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:
apple, peace = (int(i) for i in input().split())
peace += apple*3
print(peace//2)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

mod = 1000000007
inf = 1 << 60

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

a, p = na()

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

Submission status: Accepted

Solution code:
import sys
import math

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

A = num[0]
P = num[1]
parts = A*3+P
print(math.floor(parts/2))

Submission status: Accepted

Solution code:
import math
app, p = (int(x) for x in input().split())
pie = math.floor((app*3+p)/2)
print(pie)

Submission status: Accepted

Solution code:

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
a,p=nm()
print(((3*a+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())

p = (A * 3) + P

pie, m = divmod(p, 2)

print(pie)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cut = a * 3
total = cut + p

print(total // 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())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(int(r))

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 12, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b = map(int,read().split())
print((b+a*3)//2)

Submission status: Accepted

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

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

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=(int(i) for i in input().split())
print((3*a+p)//2)

Submission status: Accepted

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

parts = 3 * A + P

if parts % 2 == 0:
    print(round(parts / 2))
else:
    print(round((parts - 1) / 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((p+3*a)//2)

Submission status: Accepted

Solution code:
x = input()
x_list = x.split(" ")
a = int(x_list[0])
p = int(x_list[1])

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

Submission status: Accepted

Solution code:
def examA():
    A, P = LI()
    ans = (A*3+P)//2
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l=[int(i) for i in input().split()]
print((l[0]*3+l[1])//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,b=map(int, input().split())
print(int((a*3+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 = (a*3+p) // 2
print(ans)

Submission status: Accepted

Solution code:
a,p=[int(i) for i 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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,p=INTM()
    print((3*a+p)//2)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,p = map(int,input().split())
x = (3*a+p)//2
if x == 0:
    print(0)
else:
    print(x)

Submission status: Accepted

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

a = a*3 + p

pie = a//2

print(pie)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A,P= [int(i) for i in input().split()]
sum = 3 * A + P
k = sum//2
print(k)

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split(" ")]

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

Submission status: Accepted

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

print(int(P/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

total = a * 3 + p

print(total//2)

Submission status: Accepted

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

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:
A, P = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

a, p = map(int, input().split())
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())
b=3*a+p
if b%2==0:
  print(b//2)
else:
  print((b-1)//2)

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

if (3*a+p)%2 == 0:
    print((3*a+p)//2)
else:
    print((3*a+p-1)//2)

Submission status: Accepted

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

Submission status: Accepted

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

p = 3*a + p

print(int(p/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

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

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

print(ans)

Submission status: Accepted

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

count = (b+3*a)//2

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
a, q = map(int,input().split())
print(((a*3)+q)//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 = input().split()
A = int(A)
P = int(P)
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:
A, P = map(int, input().split())
a = A*3
p = P + a
print(p//2)

Submission status: Accepted

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

Submission status: Accepted

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

answer = A * 3 + P

print(answer // 2)

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

a,p = inpl()
print((a*3+p)//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,raw_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 = map(int, input().split())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = [int(i) for i in input().split()]

if x[0] < 1 and x[1] < 2:
    print(0)
else:
    print(((x[0] * 3) + x[1]) // 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 = list(map(int, input().split()))

P += A*3

print(P//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = map(int, input().split())

sum_keppen = x*3 +y

print(sum_keppen//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(int((3*a + p)/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())

a_parts = (3 * A) + P
ap = a_parts // 2 if a_parts // 2 else 0

print(ap)

Submission status: Accepted

Solution code:
A,P = map(int,input().split())
print(int(((3*A)+P)//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():
    a, p = rli()
    print((a*3+p)//2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
p,q=map(int,input().split())
print((p*3+q)//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((3*A+P)//2)

Submission status: Accepted

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

print(str((n*3+k)//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:
A,P = map(int, input().split())

P += A*3
print(int(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((p+3*a)//2)

Submission status: Accepted

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

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

Submission status: Accepted

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

if a == 0 and p == 0:
  ans = 0
else:
  ans = (a * 3 + p) // 2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8 
#Author:Code
a, p = map(int, raw_input().split())
print (a*3+p)/2

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = (i[0]*3 + i[1])//2
print(ans)

Submission status: Accepted

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

x = a * 3
y = (x + p) // 2

print(y)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import datetime

# 入力
#N = int(input())
#S = str(input())
#H, W = map(int, input().split())
A, P = map(int, input().split())

print (math.floor(((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=tuple(map(int,input().split()))
print((A*3+P)//2)

Submission status: Accepted

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

Submission status: Accepted

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

N_piec = A * 3  + P
N_pie  = N_piec / 2
print N_pie

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())
x = (3*a + p)//2
print(x)

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(A, P):
    """Test Case
    >>> print_ans(1, 3)
    3
    >>> print_ans(0, 1)
    0
    >>> print_ans(32, 21)
    58
    """
    print((A * 3 + P) // 2)

if __name__ == '__main__':
    A, P= map(int, input().rstrip().split())
    print_ans(A, P)

Submission status: Accepted

Solution code:
from collections import defaultdict,deque, Counter
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
ans = 1

[A,P] = inpl()
print((3*A+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())

Ringonokakera = (P+(A*3))

print(Ringonokakera//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
arguments = input()
arguments_as_list = arguments.split(" ")
list_to_integer = list(map(int, arguments_as_list))
apples_pieces = list_to_integer[0]*3
pieces = list_to_integer[1]


print(int((apples_pieces + pieces)//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, p = map(int, input().split())
print((a*3 +p)//2)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a, p = sys.stdin.readline().rstrip().split()
a = int(a)
p = int(p)

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()))
print((A*3+P)//2)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import unittest


class TestA(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(1, 3), 3)

    def test_2(self):
        self.assertEqual(think(0, 1), 0)

    def test_3(self):
        self.assertEqual(think(32, 21), 58)


def solve():
    a, p = read()
    result = think(a, p)
    write(result)


def read():
    return read_int(2)


def read_int(n):
    return read_type(int, n)


def read_float(n):
    return read_type(float, n)


def read_type(t, n):
    return list(map(lambda x: t(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a, p):
    return (a * 3 + p) // 2


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

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

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

Submission status: Accepted

Solution code:
# 2019-11-13 21:06:16(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np 

def main():
    a, p = [int(x) for x in sys.stdin.readline().split()]
    pieces = a * 3 + p
    pies = pieces // 2
    print(pies)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(int((data[0]*3+data[1])/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(10**9)
def input():
    return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
apple, piece = map(int,input().split())

sum = (apple*3)+piece

ans = sum//2

print(ans)

Submission status: Accepted

Solution code:
a,p=list(map(int,input().split(" ")))
p=p+3*a
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:
a,p=map(int,input().split())
print (int(((a*3)+p)/2))

Submission status: Accepted

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

A = int(A)

P = int(P)

P = P+A*3

print(P//2)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
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:
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = list(map(int, input().split()))
a = tmp[0]
p = tmp[1]

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#%%
import sys
def input():
    return sys.stdin.readline().rstrip()

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

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

# %%
# from atcoder_test import doTest
# doTest("abc128","a",main)

Submission status: Accepted

Solution code:
# ABC 128: A – Apple Pie
a, p = [int(s) for s in input().split()]
print((a * 3 + p) // 2)

Submission status: Accepted

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

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