您当前位置：首页 > php开源 > php教程 > 50A - Domino piling

50A - Domino piling

来源：程序员人生发布时间：2014-12-12 08:36:30 阅读次数：3429次

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

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int m=sc.nextInt(); int n=sc.nextInt(); System.out.println(m*n/2); } }

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 【Foundation Frame】NSString

下一篇 2014ACM/ICPC 广州赛区E题（水~）

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点