Searching for Nessy
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 number s 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 and m 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
题意:
给出n*m的方格,要求最小的声呐位置需要几个?边缘位置可以不需要考虑,水怪太大了.
最小需要的声呐个数公式:
n/3 * m/3
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int x;
int y;
for(int i = 0; i < n; i ++)
{
cin >> x >> y;
int a = x/3;
int b = y/3;
printf("%d\n",a*b);
}
return 0;
}