加入收藏 | 设为首页 | 会员中心 | 我要投稿 李大同 (https://www.lidatong.com.cn/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 站长学院 > PHP教程 > 正文

50A - Domino piling

发布时间:2020-12-13 20:22:16 所属栏目:PHP教程 来源:网络整理
导读:A. Domino piling time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a rectangular board of M ?×? N squares. Also you are given an unlimited number of standard domino

A. Domino piling
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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); } }

(编辑:李大同)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读