PS [07] | Domino Piling Codeforces Solution using C++ - شرح بالعربي
Problem Link: https://codeforces.com/problemset/pro...
(A. Domino piling)
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.
=============================
📺 Playlist Link: • Problem Solving (Leetcode and Codefor...
👤 Connect with me on LinkedIn: / abdallafadl
Watch video PS [07] | Domino Piling Codeforces Solution using C++ - شرح بالعربي online without registration, duration hours minute second in high quality. This video was added by user Abdalla Fadl 01 January 1970, don't forget to share it with your friends and acquaintances, it has been viewed on our site 159 once and liked it 6 people.