zoukankan      html  css  js  c++  java
  • Codeforces 50A

    题目: A. Domino piling

    time limit per test: 2 seconds
    memory limit per test: 256 megabytes
    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
    2 4
    Output
    4
    Input
    3 3
    Output
    4

    思路:

    由题意分析我们可知,要么可以把MN铺满,要么只会剩一个面积单位没有被铺上,因此mn/2即是结果;

    代码:

    #include<iostream>
    using namespace std;
    int main(){
    	int m,n;
    	scanf("%d%d",&m,&n);
    	printf("%d",m*n/2);
    	return 0;
    }
    
  • 相关阅读:
    注意事项 软件连接的数据库是设置输出的数据库,弄错会造成数据库不一致
    归并排序
    快速排序
    冒泡排序
    插入排序
    上次遗留下来的XMLUtil的问题
    关于子网掩码
    java.lang.InstantiationException
    java.lang.ExceptionInInitializerError
    关于HashMap中的负载因子
  • 原文地址:https://www.cnblogs.com/yuhan-blog/p/12308974.html
Copyright © 2011-2022 走看看