UVA11044 - Searching for Nessy

写的忘了一个问题，整除和余数。

题目：

Searching for Nessy

 

Searching for Nessy

The Loch Ness Monsteris a 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

 

 

---

 

解答：

#include<stdio.h>
int main()
{
	int t,n,m,x,y;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		n-=2;
		m-=2;
		x=n/3+(n%3!=0);
		y=m/3+(m%3!=0);
		int i,k=0;
		for(i=0;;i++)
		{
			if(m<=0&&n<=0)
				break;
			else if(m<=0)
			{
				n-=3;
				k+=y;
			}
			else if(n<=0)
			{
				m-=3;
				k+=x;
			}
			else
			{
				m-=3;
				n-=3;
				k+=(2*i+1);
			}
		}
		printf("%d\n",k);
	}
	return 0;
}