UVA 11044 Searching for Nessy

最新推荐文章于 2019-07-31 10:04:25 发布

lab104_yifan

最新推荐文章于 2019-07-31 10:04:25 发布

阅读量1k

点赞数

本文链接：https://blog.csdn.net/accelerator_/article/details/9636375

版权

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, 6 $\le$ n, m $\le$ 10000, 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,

$\textstyle \parbox{.5\textwidth}{\begin{center}\mbox{}\epsfbox{p11044.eps}\end{center}}$ $\textstyle \parbox{.49\textwidth}{\begin{center}\mbox{}\epsfbox{p11044a.eps}\end{center}}$

$\epsfbox{p11044b.eps}$

知道题意就是水题。。。

求出一个矩阵内 3 * 3 正方形的最多个数。。。 - -

好像没什么好说的。。就看长和宽分别是3个多少整数倍。。。

直接看代码吧。。

#include <stdio.h>
#include <string.h>

int t;

int main()
{
	scanf("%d", &t);
	int n, m;
	while (t --)
	{
		scanf("%d%d", &n, &m);
		printf("%d\n", (n / 3) * (m / 3));
	}
	return 0;
}