CodeForces 50A 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.

输入

2 4
3 3

输出

4
4

题目大意：给你一个M×N的矩形，让你用2×1的矩形覆盖它，求最多的2×1矩形数量

解题思路：要么全覆盖，要么剩一个，所以为（N*M）/2

代码：

#include<iostream>
using namespace std;
int main(){
	int m,n;
	cin>>m>>n;
	cout<<n*m/2;
}

有用的英文单词：overlap 覆盖 entirely 完全地；全部地 restriction 限制