题库
比赛
近期比赛
排名
话题
编译器
登录
题目描述
题解
我的提交
1049.Domino piling
查看全部提交
提交状态
耗时
内存
语言
提交时间
1049.Domino piling
时间限制:1000MS 内存限制:65535KB
题目描述
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.
输入描述
In a single line you are given two integers M and N --- board sizes in squares (1≤M≤N≤16).Process to end of file.
输出描述
Output one number --- the maximal number of dominoes, which can be placed.
示例
输入样例
2 4 3 3
输出样例
4 4
提示
相关标签
greedy
math
发布题解
个题解
GNU C++ 9.3.0
GNU C 9.3.0
Java 1.8
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
登陆后才可以提交
测试输入
执行结果
2 4 3 3
请先执行代码
控制台
代码编辑器配置
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题,选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数,设置为0则不限制。
0
80
100
120