CF50A.Domino piling

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

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:

1. Each domino completely covers two squares.

2. No two dominoes overlap.

3. 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.

输入格式

In a single line you are given two integers $M$ and $N$ — board sizes in squares ( $1<=M<=N<=16$ ).

输出格式

Output one number — the maximal number of dominoes, which can be placed.

输入输出样例

输入#1
```
2 4
```
输出#1
```
4
```
输入#2
```
3 3
```
输出#2
```
4
```

首页