您當前位置：首頁 > php開源 > php教程 > 50A - Domino piling

50A - Domino piling

來源：程序員人生發布時間：2014-12-12 08:36:30 閱讀次數：3572次

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關注

欄目熱點

多多色-多人伦交性欧美在线观看-多人伦精品一区二区三区视频-多色视频-免费黄色视屏网站-免费黄色在线

50A - Domino piling