WHOJ 1606 - Funny Sheep【水】

最新推荐文章于 2016-04-21 19:20:17 发布

原创最新推荐文章于 2016-04-21 19:20:17 发布 · 356 阅读

0 ·

CC 4.0 BY-SA版权

数学专栏收录该内容

46 篇文章

订阅专栏

本文探讨了一个有趣的算法问题——如何通过最少的步骤移除栅栏让所有羊聚集在一起。问题设定在一个由N+1行和M+1列组成的网格中，每个网格内有一只羊，目标是最小化移除栅栏的次数。

Problem 1606 - Funny Sheep

Time Limit: 1000MS Memory Limit: 65536KB
Total Submit: 616 Accepted: 172 Special Judge: No

Description

There are N+1 rows and M+1 columns fence with N*M grids on the grassland. Each grid has a sheep. In order to let the sheep together, we need to dismantle the fence. Every time you can remove a row or a column of fences. What’s the least number of times to reach the goal?

Input

There are multiple test cases.
The first line of each case contains two integers N and M. (1≤N,M≤1000)

Output

For each case, output the answer in a line.

Sample Input

1 2
2 2

Sample Output

1
2

AC-code：

#include<cstdio>
int main()
{
	int n,m;
	while(~scanf("%d%d",&m,&n))
	{
		if(m==n&&n==1)
		{
			printf("0\n");
		 } 
		 else
		 	printf("%d\n",n<m?n:m);
	}
	return 0;
}