696人阅读 评论(0)

# Searching for Nessy

The Loch Ness Monsterisa mysterious and unidentified animal said to inhabit Loch Ness,
a large deep freshwaterloch near the cityof Inverness in northern Scotland. Nessie is usually categorized as a type oflake monster.

http://en.wikipedia.org/wiki/Loch_Ness_Monster

In July 2003, the BBC reported an extensive investigation of Loch Ness by a BBCteam, using 600 separate sonar beams, found no trace of any ¨sea monster¨(i.e., any large animal, known or unknown) in the loch. The BBC team concludedthat Nessie does not exist. Now we want to repeat the experiment.

Given a grid of n rows and m columns representing the loch, 6n,m10000, find the minimum numbers of sonar beams you must put in the square such that we can control every position in thegrid, with the following conditions:

• one sonar occupies one position in the grid; the sonar beam controls its own cell and the contiguous cells;
• the border cells do not need to be controlled, because Nessy cannot hide there (she is too big).

For example,

where X represents a sonar, and the shaded cells are controlled bytheir sonar beams; the last figure gives us a solution.

## Input

The first line of the input contains an integer, t, indicating the number of test cases. For eachtest case, there is a line with two numbers separated by blanks,6n,m10000, that is, the size of the grid (n rows andm columns).

## Output

For each test case, the output should consist of one line showing the minimumnumber of sonars that verifies the conditions above.

## Sample Input


3
6 6
7 7
9 13


## Sample Output


4
4
12

#include<stdio.h>
int main(void)
{
int t;
int n,m;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
printf("%d\n",(n/3)*(m/3));
}
return 0;
}

1
0

【视频】C语言及程序设计（讲师：贺利坚）
【视频】Python爬虫工程师培养课程全套（讲师:韦玮）
【视频】Python全栈开发入门与实战（讲师：李杰）
【视频】2017软考网络规划设计师套餐（讲师：任铄）
【视频】2017软考软件设计师套餐（讲师：任铄）
【视频】2017软考信息系统项目管理师套餐（讲师：任铄）
【视频】软考(高级)项目经理实战营（讲师：张传波）
【视频】微信公众平台开发套餐（讲师：刘运强）

2017系统集成项目管理工程师通关套餐（讲师：徐朋）

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：95094次
• 积分：2471
• 等级：
• 排名：第14474名
• 原创：152篇
• 转载：0篇
• 译文：0篇
• 评论：0条
文章分类
阅读排行
评论排行