热门标签 | HotTags
当前位置:  开发笔记 > 编程语言 > 正文

【水读题】#47A.Dominopiling

A.Dominopilingtimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutp


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 × 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
using namespace std;
int main()
{int m,n; cin>>m>>n; cout<}






推荐阅读
author-avatar
优雅的鼻涕泡
这个家伙很懒,什么也没留下!
PHP1.CN | 中国最专业的PHP中文社区 | DevBox开发工具箱 | json解析格式化 |PHP资讯 | PHP教程 | 数据库技术 | 服务器技术 | 前端开发技术 | PHP框架 | 开发工具 | 在线工具
Copyright © 1998 - 2020 PHP1.CN. All Rights Reserved | 京公网安备 11010802041100号 | 京ICP备19059560号-4 | PHP1.CN 第一PHP社区 版权所有