AtCoder Beginner Contest 062
翻译中…
Problem Statement
翻译中…
There is a bar of chocolate with a height of $H$ blocks and a width of $W$ blocks. Snuke is dividing this bar into exactly three pieces. He can only cut the bar along borders of blocks, and the shape of each piece must be a rectangle.
翻译中…
Snuke is trying to divide the bar as evenly as possible. More specifically, he is trying to minimize $S_{max}$ - $S_{min}$, where $S_{max}$ is the area (the number of blocks contained) of the largest piece, and $S_{min}$ is the area of the smallest piece. Find the minimum possible value of $S_{max} - S_{min}$.
翻译中…
Constraints
翻译中…
$2 ≤ H, W ≤ 10^5$
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
H W
翻译中…
Output
翻译中…
Print the minimum possible value of $S_{max} - S_{min}$.
翻译中…
样例
Input #1
3 5
Output #1
0
In the division below, $S_{max} - S_{min} = 5 - 5 = 0$.

Input #2
4 5
Output #2
2
In the division below, $S_{max} - S_{min} = 8 - 6 = 2$.

Input #3
5 5
Output #3
4
In the division below, $S_{max} - S_{min} = 10 - 6 = 4$.

Input #4
100000 2
Output #4
1
Input #5
100000 100000
Output #5
50000
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。