小声BB
又有简单题了,舒服了舒服了舒服了
题干
time limit per test:2 seconds
memory limit per test:256 megabytes
input:standard input
output:standard output
You are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:
-
Each domino completely covers two squares.
-
No two dominoes overlap.
-
Each domino lies entirely inside the board. It is allowed to touch the edges of the board.
Find the maximum number of dominoes, which can be placed under these restrictions.
Input
In a single line you are given two integers M and N — board sizes in squares (1 ≤ M ≤ N ≤ 16).
Output
Output one number — the maximal number of dominoes, which can be placed.
Examples
Input
2 4
Output
4
Input
3 3
Output
4
分析
这道题甚至要比1A简单,就是说m×n的广场里最多可以塞几块1×2。我们知道有一条边是偶数时,无论另一边是什么情况都可以塞满,那么都为奇数时,我们可以看成