Code forces problem Domino piling : C++ Problem-Solving

Опубликовано: 20 Февраль 2024
на канале: Ahmad Code

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.
----------------------------------------------------------------------------------------------------------------------
Subscribe to see more ✔
Problem link 🔗
https://judge.beecrowd.com/en/problem...
LinkedIn account 🔗
/ ahmad-joba-772a61201
Facebook page 🔗
/ profile.phpid=61555793325064&viewas=&show_...
---------------------------------------------------------------------------------------------------------------
#code #codeforcessolutions #beecrowd #solution #programming #computerscience #problemsolving

На этой странице сайта вы можете посмотреть видео онлайн Code forces problem Domino piling : C++ Problem-Solving длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Ahmad Code 20 Февраль 2024, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 31 раз и оно понравилось 1 зрителям. Приятного просмотра!

306,476

8.8 тыс