CF1034B.Little C Loves 3 II

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Little C loves number «3» very much. He loves all things about it.

Now he is playing a game on a chessboard of size $n \times m$ . The cell in the $x$ -th row and in the $y$ -th column is called $(x,y)$ . Initially, The chessboard is empty. Each time, he places two chessmen on two different empty cells, the Manhattan distance between which is exactly $3$ . The Manhattan distance between two cells $(x_i,y_i)$ and $(x_j,y_j)$ is defined as $|x_i-x_j|+|y_i-y_j|$ .

He want to place as many chessmen as possible on the chessboard. Please help him find the maximum number of chessmen he can place.

输入格式

A single line contains two integers $n$ and $m$ ( $1 \leq n,m \leq 10^9$ ) — the number of rows and the number of columns of the chessboard.

输出格式

Print one integer — the maximum number of chessmen Little C can place.

输入输出样例

输入#1
```
2 2
```
输出#1
```
0
```
输入#2
```
3 3
```
输出#2
```
8
```

说明/提示

In the first example, the Manhattan distance between any two cells is smaller than $3$ , so the answer is $0$ .

In the second example, a possible solution is $(1,1)(3,2)$ , $(1,2)(3,3)$ , $(2,1)(1,3)$ , $(3,1)(2,3)$ .

首页