Domino piling_Codeforces_50A

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

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 ≤ M ≤ N ≤ 16).

Output

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

思路：判断m或n的奇偶数，若有一个及以上为偶数，能全覆盖，否则不能全覆盖

#include<cstdio>int main(){    int m, n;    scanf("%d%d", &m, &n);    int sum;    if(m % 2 == 0)        sum = (m / 2) * n;    else if(n % 2 == 0)        sum = (n / 2) * m;    else        sum = m * n / 2;    printf("%d\n", sum);    return 0;}