解题报告：8VC Venture Cup 2016 — Elimination Round C.Block Towers

C. Block Towers

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.

The students don’t want to use too many blocks, but they also want to be unique, so no two students’ towers may contain the same number of blocks. Find the minimum height necessary for the tallest of the students' towers.

Input

The first line of the input contains two space-separated integers n and m (0 ≤ n, m ≤ 1 000 000, n + m > 0) — the number of students using two-block pieces and the number of students using three-block pieces, respectively.

Output

Print a single integer, denoting the minimum possible height of the tallest tower.

Examples

input

1 3

output

9

input

3 2

output

8

input

5 0

output

10

Note

In the first case, the student using two-block pieces can make a tower of height 4, and the students using three-block pieces can make towers of height 3, 6, and 9 blocks. The tallest tower has a height of 9 blocks.

In the second case, the students can make towers of heights 2, 4, and 8 with two-block pieces and towers of heights 3 and 6 with three-block pieces, for a maximum height of 8 blocks.

题目大意：

有两伙人，一伙人只会用码2的倍数的积木，另一伙人只会码3的倍数的积木，要求所有人的积木数不能重复。问最小的某人积木的最大值是多少？

可能不是很明白，看第二组数据： 3 2

那么二的倍数的积木可以为2,4,6，此时三的倍数的积木则为3,9，因为6已经有了，则不能再取。但是9不是一定会有的最大值，如果三的倍数的积木为3,6，那么二的倍数的积木则为2,4,8，所以8为最小的最大值也就是答案。

 

思路：

Cf的机器的效率非常高，看了看数据规模1e6，感觉枚举有超时的可能，但是后面查看一些比较大的数据发现几乎都是0ms。

每次给二的倍数的最大值加2，三的倍数的最大值加3，较小的不变，较大的还原，并把较小的数目减一，如果相等，则判断剩下的二的倍数*2和剩下的三的倍数*3的较大值，将对应的数目减一，重复以上操作直到某一倍数的数目为0。详见代码。

代码：

#include<bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    int n2,n3,num2=0,num3=0,ans;
    cin>>n2>>n3;
    {
        while(n2&&n3)
        {
            num2+=2;num3+=3;
            if(num2<num3)
                num3-=3,n2--;
            else if(num2>num3)
                num2-=2,n3--;
            else
            {
                if(2*n2>3*n3)
                    n2--;
                else
                    n3--;
            }
        }
        ans=max(num2+n2*2,num3+n3*3);
        printf("%d\n",ans);
    }
}