101280: [AtCoder]ABC128 A - Apple Pie

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

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

Input

题意翻译

有 $A$ 个苹果和 $P$ 个苹果片。 一个苹果能变成 $3$ 个苹果片,两个苹果片能做成 $1$ 个苹果派,问你可以得到几个苹果派。

加入题单

算法标签: