{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYou are given a rectangular board of \u003cspan class\u003d\"tex-span\"\u003e\u003ci\u003eM\u003c/i\u003e × \u003ci\u003eN\u003c/i\u003e\u003c/span\u003e squares. Also you are given an unlimited number of standard domino pieces of \u003cspan class\u003d\"tex-span\"\u003e2 × 1\u003c/span\u003e 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:\u003c/p\u003e\n给你一个由 M × N 方格组成的矩形板。此外,您还获得无限数量的 2 × 1 方格的标准多米诺骨牌。您可以旋转棋子。您需要在棋盘上放置尽可能多的多米诺骨牌,以满足以下条件:\n\u003cp\u003e1. Each domino completely covers two squares.\u003c/p\u003e\n1. 每张多米诺骨牌完全覆盖两个方格。\n\u003cp\u003e2. No two dominoes overlap.\u003c/p\u003e\n2. 没有两块多米诺骨牌重叠。\n\u003cp\u003e3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\u003c/p\u003e\n3. 每张多米诺骨牌都完全位于棋盘内部。允许接触板子的边缘。\n\u003cp\u003eFind the maximum number of dominoes, which can be placed under these restrictions.\u003c/p\u003e\n找出在这些限制下可以放置的多米诺骨牌的最大数量。"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eIn a single line you are given two integers \u003cspan class\u003d\"tex-span\"\u003e\u003ci\u003eM\u003c/i\u003e\u003c/span\u003e and \u003cspan class\u003d\"tex-span\"\u003e\u003ci\u003eN\u003c/i\u003e\u003c/span\u003e — board sizes in squares (\u003cspan class\u003d\"tex-span\"\u003e1 ≤ \u003ci\u003eM\u003c/i\u003e ≤ \u003ci\u003eN\u003c/i\u003e ≤ 16\u003c/span\u003e).\u003c/p\u003e\n在一行中,您将获得两个整数 M 和 N——以正方形表示的棋盘尺寸 (1 ≤ M ≤ N ≤ 16)。"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eOutput one number — the maximal number of dominoes, which can be placed.\u003c/p\u003e\n输出一个数字——可以放置的最大多米诺骨牌数量。"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2 4\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 2","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}