50A - Domino piling

前端之家收集整理的这篇文章主要介绍了50A - Domino piling前端之家小编觉得挺不错的,现在分享给大家,也给大家做个参考。

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

猜你在找的PHP相关文章