跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1774. Domino piling

    ID: 1780 传统题 2000ms 256MiB 尝试: 1 已通过: 1 难度: 1 上传者: 标签>贪心数学算法思想入门难度共享题库Codeforces英文题面题目来源题面语言

Domino piling

题目描述

A. Domino piling
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:

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.

Input

In a single line you are given two integers M and N − board sizes in squares (1≤MN≤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

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1326 题。保留原作者与原赛事署名。