Searching for Nessy
来源:互联网 发布:mac上面逗号怎么打 编辑:程序博客网 时间:2024/05/19 13:08
水题。。。。太水了。。水得一手好水。。
Searching for Nessy
The Loch Ness Monsteris a mysterious and unidentified animal said to inhabit Loch Ness,
a large deep freshwater loch near the city of Inverness in northern Scotland. Nessie is usually categorized as a type of lake monster.
http://en.wikipedia.org/wiki/Loch_Ness_Monster
In July 2003, the BBC reported an extensive investigation of Loch Ness by a BBC team, 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 concluded that 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 number s of sonar beams you must put in the square such that we can control every position in the grid, 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 by their 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 each test case, there is a line with two numbers separated by blanks, 6n, m10000, that is, the size of the grid (n rows and m columns).
Output
For each test case, the output should consist of one line showing the minimum number of sonars that verifies the conditions above.
Sample Input
36 67 79 13
Sample Output
4412
12345678910111213141516171819202122
#include <stdio.h>int main(){ int m, n, t, i, x, y; scanf("%d",&t); for(i = 0; i < t; i++) { scanf("%d%d",&m,&n); m = m - 2; n = n - 2; if(m%3==0) x = m / 3; else x = m / 3 + 1; if(n%3==0) y = n / 3; else y = n / 3 + 1; printf("%d\n",x*y); } return 0;}
- 11044 - Searching for Nessy
- 11044 - Searching for Nessy
- 11044 - Searching for Nessy
- UVA11044 - Searching for Nessy
- Searching for Nessy
- Searching for Nessy
- 11044 - Searching for Nessy
- UVA11044 Searching for Nessy
- uva11044 Searching for Nessy
- Searching for Nessy
- UVa 11044 - Searching for Nessy
- uva 11044 Searching for Nessy
- uva 11044 - Searching for Nessy
- uva-11044 - Searching for Nessy
- UVa 11044 - Searching for Nessy
- UVa 11044 - Searching for Nessy
- UVa 11044 - Searching for Nessy
- UVA 11044 Searching for Nessy
- Activiti工作流之应用
- How Many Points of Intersection?
- 文件操作-标准I/O操作--getchar() getc()
- db file sequential read等待事件总结
- HTK搭建大词汇量连续语音识别系统(四)
- Searching for Nessy
- 两种主要MySQL表存储结构MyISAM和InnoDB比较
- 常用的ps小功能
- 心无挂碍地编程精进
- jq渐变动画效果
- 把二元查找树转变成排序的双向链表
- Quotient Polynomial
- 判断指定路径下文件是否存在
- 《实用OpenCV》<五> 图像滤波(2)