UVA Searching for Nessy(找规律)
来源:互联网 发布:淘宝网葫芦丝 编辑:程序博客网 时间:2024/05/20 04:50
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
#include<iostream>#include<algorithm>using namespace std;int main(){ int n,m; int T; cin >> T; while(T--) { cin >> n >> m; n = n/3; m = m/3; cout << n*m << endl; } return 0;}
- UVA 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
- 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
- uva 11044 Searching for Nessy
- HTTP协议小结
- myeclipse转换
- XmlHttpRequest
- Ubuntu“无法解析或打开软件包的列表或是状态文件”的解决办法。
- VC++多线程方法,简单有效
- UVA Searching for Nessy(找规律)
- SharedPreferences存储数据
- 什么是lambda expressions in java
- 指针函数与函数指针
- UVA The Land of Justice(找规律)
- 找出热点块所属的用户,对象名,类型
- 罗技智能家居战略第一步:开放万能遥控器API
- 8章8题
- 如何在Xcode6中添加空模板