编程介的小学生 2017-11-28 04:59 采纳率: 20.5%
浏览 810
已采纳

Bricks

Problem Description
Little White bought a new house recently. She doesn't like the design of the floor anyway, so she decides to decorate the floor. Now she has bricks of the 5 shapes below, all with an infinite amount.

Bricks cannot overlap each other, and you cannot rotate them to fit in the "holes".

Now, please tell Little White how many units can she cover using these bricks.

Input
For every test case, you are given two integers n and m indicating the floor is an n*m rectangle

consisting of n*m 1*1 grids.(1<=n<=100,1<=m<=6)

Proceed to the end of file.

Output
For every test case, print an integer on a single line, representing the maximum possible area that can

be covered.

Sample Input
1 4
2 3
3 2
4 4

Sample Output
0
4
4
12

  • 写回答

1条回答 默认 最新

  • threenewbee 2017-12-24 14:54
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥15 (标签-Python|关键词-socket)
  • ¥15 keil里为什么main.c定义的函数在it.c调用不了
  • ¥50 切换TabTip键盘的输入法
  • ¥15 可否在不同线程中调用封装数据库操作的类
  • ¥15 微带串馈天线阵列每个阵元宽度计算
  • ¥15 keil的map文件中Image component sizes各项意思
  • ¥20 求个正点原子stm32f407开发版的贪吃蛇游戏
  • ¥15 划分vlan后,链路不通了?
  • ¥20 求各位懂行的人,注册表能不能看到usb使用得具体信息,干了什么,传输了什么数据
  • ¥15 Vue3 大型图片数据拖动排序