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:
# -*- coding: utf-8 -*-
import sys;
import string;
sys.setrecursionlimit(20000) # 再起呼び出しの最大数をセット

from functools import lru_cache
#@lru_cache(maxsize = None)

# 整数の入力
#n = int(input())

# スペース区切りの整数の入力
#a = [x for x in map(int, input().split())]
a, p = map(int, input().split())
#print(n, q, file=sys.stderr)

# 改行区切りの整数の入力
#a = []
#for x in range(n):
#  a.append(int(input()))

# 文字列の入力
#s = input()

# 出力
#print("{} {}".format(a+b+c, s))
#a.sort()
#print(set(a), file=sys.stderr)
#print(len(set(a)))

#cache = dict()


def doit(n, s):
  if n < 2:
    return
  print(s, file=sys.stderr)

  last = n - 1
  for x in range(last):
    if qa(s[x], s[last]):
      swap = s[x]
      s[x] = s[last]
      s[last] = swap
  doit(last, s)

try:
  print ((a * 3 + p) // 2)
#  doit(n, s)
except Exception as e:
  print(e, file=sys.stderr)
  print(s)

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    inp = input().split(' ')
    a = int(inp[0])
    p = int(inp[1])
    print(str((a * 3 + p) // 2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N,M = input().split()
N = int(N)
M = int(M)

sum = N*3 + M
pie = sum//2

print(pie)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

pie = int((A * 3 + P) / 2)

print(pie)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('{}'.format((3*A+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=[int(_) for _ in input().split()]
print((a*3+p)//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- 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())
a = (A*3 + P)//2
print(a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math


def main():
    A, P = map(int, input().split())

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
apple, piece = input().split(" ")
crushed_piece = int(apple) * 3 + int(piece)
print(crushed_piece//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ap = input().split()
a = int(ap[0])
p = int(ap[1])
k = 3*a + p
aa = k // 2
print(aa)

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 = list(map(int,input().split()))
kakera = A*3+P
print(int(kakera/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())
s = 3*a + p
print(int(s/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
#a, b = map(int, input().split())
#a, b, c, x = map(int, [input() for i in range(4)])

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

piece = 3 * a + p
pi = int(piece / 2)

print(pi)

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

a, b = readmi()
print((a * 3 + b) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

A,P = mi()
print((3*A+P)//2)

Submission status: Accepted

Solution code:
# n=int(input())
# a,b=map(int, input().split())
# c=list(map(int, input().split()))
# s=[list(map(int,list(input()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

# a=100
# b=0.987654321
# print('{0:06d}-{1:6f}'.format(a,b))  # 0埋めのときの出力
# 000100-0.987654

import numpy as np
import math
import copy

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x = A * 3
y = x + B

print(int(y / 2))

Submission status: Accepted

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

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

b = a*3 + p

ans = int(b/2)
print(ans)

Submission status: Accepted

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

p1=p+(3*a)

print(p1//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = (apple * 3 + piece) // 2

print(ans)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, p = [int(x) for x in input().split()]

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

Submission status: Accepted

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


def solve(A: int, P: int):
    ret = (3 * A + P) // 2
    print(ret)
    return


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

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

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
apple_num, apple_peace = map(int, input().split())

peace_sum = 3 * apple_num + apple_peace

print(peace_sum // 2)

Submission status: Accepted

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

a_particle = A * 3 + P

num_max = a_particle // 2
print num_max

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# abc 128a
# input
a, b = map(int, input().split())
print((a*3+b)//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
a, p = (int(_) for _ in input().split())

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

Submission status: Accepted

Solution code:
# coding: utf-8
import os
import time
import re
import math


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

Submission status: Accepted

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

Submission status: Accepted

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

C=A*3+B
print(C//2)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

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

Submission status: Accepted

Solution code:
#ABC128A-ApplePie.py

from sys import stdin

input = stdin.readline

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

print((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:
from collections import *
from functools import *
from itertools import *

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


if __name__ == "__main__":
    main()
    pass

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

piece = 0
pie = 0

piece = A * 3 + P

print(int(piece / 2))

Submission status: Accepted

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


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


def INT(): return int(input())


def MAP(): return map(int, input().split())


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


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

a, p = MAP()

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

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
P += A * 3
ans = int(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:
# ABC128A - Apple Pie
a, p = list(map(int, input().rstrip().split()))
print((a * 3 + p) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
from collections import defaultdict
from functools import reduce

# s = input()
# n = int(input())
# A = list(map(int, input().split()))
a, p = map(int, input().split())

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

class Interval():
    def __init__(self, li):
        self.li = li
        self.n = len(li)
        self.sum_li = [li[0]]
        for i in range(1, self.n):
            self.sum_li.append(self.sum_li[i-1] + li[i])

    def sum(self, a, b=None):
        if b is None:
            return self.sum(0, a)

        res = self.sum_li[min(self.n-1, b-1)]
        if a > 0:
            res -= self.sum_li[a-1]
        return res

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

def applepie(A,P):
  num=A*3+P
  return num//2

print(applepie(A,P))

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:
# -*- coding: utf-8 -*-


from sys import stdin


############################################


# read data for n sequences.
n = stdin.readline().split()
a = int(n[0])
b = int(n[1])

#data = [int(stdin.readline().rstrip()) for _ in range(n)]

out = int((a*3+b) / 2)

print(out)

#end = time.time()
#print(end-start)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A, P = [int(s) for s in input().split(" ")]
print(math.floor((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(int((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 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())

P = P + A * 3

print(int(P / 2))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

p=p+a*3

ans=int(p/2)

print(ans)

Submission status: Accepted

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

crush=A*3
pie=(P+crush)//2

print(pie)

Submission status: Accepted

Solution code:
# coding: utf-8
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
ans = p//2
print(ans)

Submission status: Accepted

Solution code:
ap=input()
ap=ap.split()
pc=int(ap[0])*3+int(ap[1])
pi=int(pc/2)
print(pi)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

def main():
    A, P = map(int, input().split())

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


def solve(A: int, P: int):
    print(int((3*A+P)/2))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    P = int(next(tokens))  # type: int
    solve(A, P)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

kakera = A * 3 + P

print(kakera//2)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
#A
apple = input()
apple = apple.split(" ")
piece =  int(apple[0])*3 + int(apple[1])
pie = int(piece)/2
print(int(pie))

Submission status: Accepted

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

num=[]
num=[int(i) for i in input().split()]

print(int((num[0]*3+num[1])/2))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

p += 3*a

ans = 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:
import sys

stdin = sys.stdin

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
#import numpy as np

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    A, P = i2nn()
    n = int((3*A + P) / 2)
    print(n)

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

p += a * 3

print("{}".format(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())
ans = (A * 3 + P) // 2
print("{}".format(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

import sys

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

A,P=MAP()

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

Submission status: Accepted

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

A, P = map(int, input().split(' '))
print((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:
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:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

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

Submission status: Accepted

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

s = a*3 + p

print(int(s/2))

Submission status: Accepted

Solution code:
A,P= (int(i) for i in input().split(" "))  

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



print(int(pie))

Submission status: Accepted

Solution code:
# coding:utf-8
# AAAAAAAAAAAAA

import math
import re

def main(params):
    a,p = [int(i) for i in params[0].split()]
    t = (a * 3 + p) / 2
    print t


if __name__ == "__main__":
    cnt = 1 # TODO: edit here
    params = []
    for i in range(cnt):
        param = raw_input()
        params.append(param)
    main(params)

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
pie = (apple+P)/2
print(int(pie))

Submission status: Accepted

Solution code:
from sys import stdin
A,P=[int(x) for x in stdin.readline().rstrip().split()]
ans=(A*3+P)/2
print(int(ans))

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
num = input().split()

sum_apple = int(num[0]) * 3 + int(num[1])

print(sum_apple//2)

Submission status: Accepted

Solution code:
l = input().split()
a,p = int(l[0]),int(l[1])
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:
def inpl(): return list(map(int, input().split()))

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

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

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

Submission status: Accepted

Solution code:
# N = int(input())
# A = [int(x) for x in input().split()]
# V = [[0] * 100 for _ in range(100)]


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
    
def main():
    a,p = [int(x) for x in stdin.readline().rstrip().split()]

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input().split(" ")

a = int(i[0])
p = int(i[1])

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

Submission status: Accepted

Solution code:
a,p = [int(x) for x in input().split()]
s = a * 3 + p
print(int(s / 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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(A: int, P: int):
    return (3 * A + P) // 2


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    P = int(next(tokens))  # type: int
    result = solve(A, P)
    if isinstance(result, Iterable) and not isinstance(result, str):
        result = '\n'.join([str(v) for v in result])
    print(result)

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

Submission status: Accepted

Solution code:
a,p=input().split()
a=int(a)
p=int(p)
p=p+a*3
ans=int(p/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 = [int(x) for x in input().split(" ")]

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

Submission status: Accepted

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