CodeForces 626C 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.

水题一道没读懂题意，意思就是求一个数，这个数里面存在n个能被2的倍数，m个3的倍数，并且以上两种数不能重复，即6的倍数只能出现一次。看懂题目的我眼泪掉下来。。。

方法1：枚举最大值为i，直到 i/2+i/3-i/6（不重复的2或3的倍数）≥n+m，并且要i/2（2的倍数）≥n，i/3（3的倍数）≥m。

方法2：枚举重复的数字i，i最小为6，每次增加6，设置两个结尾初始值为2*n，3*m，当两个结尾都比i大时，那就是还有重复。然后加在比较短的结尾。直到不再有重复。

参考博客：http://www.cnblogs.com/flipped/p/5211688.html   感谢！

1

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	int min = 1;
	while(min++) {
		if(min / 2 + min / 3 - min / 6 >= n + m && min / 2 >= n && min / 3 >= m) {
			printf("%d\n", min);
			break;
		}
	}
    return 0;
}

2

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	int ans1 = 2 * n;
	int ans2 = 3 * m;
	int i;
	for(i = 6; i <= min(ans1, ans2); i += 6) {
		if(ans1 <= ans2) {
			ans1 += 2;
		}
		else {
			ans2 += 3;
		}
	}
	printf("%d\n", max(ans1, ans2));
    return 0;
}