【水读题】#47 A. Domino piling

最新推荐文章于 2020-01-25 22:18:41 发布

糖果天王

最新推荐文章于 2020-01-25 22:18:41 发布

阅读量832

点赞数 1

CC 4.0 BY-SA版权

分类专栏： CF-A题终结者 CF-A Terminator 文章标签：水题 codeforces

本文链接：https://blog.youkuaiyun.com/okcd00/article/details/38300847

CF-A题终结者同时被 2 个专栏收录

96 篇文章

订阅专栏

CF-A Terminator

88 篇文章

订阅专栏

本文讨论了在一个M×N的矩形板上放置1×2的多米诺骨牌的最大数量问题。通过分析条件和输入输出规范，解释了解决该问题的方法并提供了一个简单的实现示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1squares. 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.

Sample test(s)

input
2 4

output
4

input
3 3

output
4

读题读懂了就行了……

N×M的地板，放1×2的多米诺牌，问最多放多少块……

肯定是偶数铺满奇数留一格么……（感觉太水了结果居然还wa了一发，因为忘了写cin就直接cout了 = =）

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