![[codeforces] A. Domino piling](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FreLtr%2FbtqxGin5gLr%2FAAAAAAAAAAAAAAAAAAAAAANw1MyBX-CK0D1Tb9a9HwNYdECWKNAjKZ2_NXIBJQT9%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1751295599%26allow_ip%3D%26allow_referer%3D%26signature%3DePalXsjN0TI%252BGMe0P20nIYt%252BAy8%253D)
알고리즘(Python,Java)2019. 8. 22. 17:34[codeforces] A. Domino piling
problem 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 th..