Problems
Contests
Events
Topic
IDE
PacketHub
Login
Description
Editorial
My Submission
1049.Domino piling
Look up all submission
Status
Time
Memory
Lang.
Submit Date
1049.Domino piling
Time Limit:1000MS Memory Limit:65535KB
Description
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).Process to end of file.
Output
Output one number --- the maximal number of dominoes, which can be placed.
Sample test
Sample input
2 4 3 3
Sample output
4 4
Note
Tags
greedy
math
Post editorial
Editorials
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)
Login before submit
Test Input
Test Output
2 4 3 3
Please run you code firstly.
Console
IDE Setting
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题,选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数,设置为0则不限制。
0
80
100
120