Problem--50A--Codeforces--Domino piling

原创于 2017-02-28 22:18:07 发布 · 664 阅读

0 ·

CC 4.0 BY-SA版权

Codeforces 专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一个算法问题，即如何在给定的矩形棋盘上放置尽可能多的标准2x1多米诺骨牌，使得每块骨牌完全覆盖两个方格且不重叠。文章提供了一段C语言代码，用于计算在限制条件下可以放置的最大多米诺骨牌数量。

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

Domino piling
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

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.

Examples

input
2 4
output
4
input
3 3
output
4

#include<stdio.h>
int main()
{
    int m,n;
    scanf("%d%d",&m,&n);
    int num=m*n;
    printf("%d\n",num/2);
    return 0;
}