cf 50A. Domino piling 贪心

题目链接：http://codeforces.com/problemset/problem/50/A

A. Domino piling

time limit per test

2 seconds

memory limit per test

256 megabytes

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 ≤ 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

题意：有n*m的地方要尽可能多的放入1*2的矩形，最多能放入多少

思路：贪心，由于N不小于M，所以尽可能在N纵向铺砖，最后再对一行空余进行处理

代码：

#define _CRT_SBCURE_MO_DEPRECATE  
#include<iostream>  
#include<stdlib.h>  
#include<stdio.h>  
#include<cmath>  
#include<algorithm>  
#include<string>  
#include<string.h>  
#include<set>  
#include<queue>  
#include<stack>  
#include<functional>   
using namespace std;
const int maxn = 100000 + 10;

int m, n;
int sum;

int main()
{
	while (scanf("%d %d", &m, &n) != EOF) {
		sum = 0;
		sum += m*(n / 2);
		n = n % 2;
		if (n != 0) {
			sum += m / 2;
		}
		printf("%d\n", sum);
	}
	//system("pause");
	return 0;
}