Algorithm

A. Domino piling
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem link- https://codeforces.com/problemset/problem/50/A
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 × 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
Copy
2 4
output
Copy
4
input
Copy
3 3
output
Copy
4



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<iostream>
using namespace std;

int main(){
  int m, n;
  cin>>m;
  cin>>n;
  int sqrAr = 2;
  cout<<((m*n)/sqrAr);
  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
2 4

Output

x
–
+
cmd
4
Advertisements

Demonstration

Codeforcess Solution 50-A A. Domino piling ,C++, Java, Js and Python ,50-A,Codeforcess Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+