习题4-2 正方形（Squares，ACM/ICPC World Finals 1990，UVa201）

原题链接：https://vjudge.net/problem/UVA-201
分类：函数
备注：简单模拟
注意：理解好 H i j 和 V i j，注意i和j到底是row还是column，紫书上没有写清楚。

代码如下：

#include<stdio.h>
#include<string.h>
const int base = 10;
int n, m, kase, size[10], h[15][15], v[15][15];//h是横边,v是竖边
char read()
{
	char ch = getchar();
	while (ch == ' ' || ch == '\n')ch = getchar();
	return ch;
}
void find()
{
	for (int i = 1; i < n; i++)
		for (int j = 1; j < n; j++)
			for (int len = 1; len <= n - i && len <= n - j; len++)
			{
				int flag = 1;
				for (int y = j; y <= j + len - 1; y++)
					if (h[i][y] == 0 || h[i + len][y] == 0)
					{
						flag = 0;
						break;
					}
				for (int x = i; x <= i + len - 1; x++)
					if (v[x][j] == 0 || v[x][j + len] == 0)
					{
						flag = 0;
						break; 
					}
				if (flag)size[len]++;
			}
	int flag = 0;
	for(int i=1;i<=n;i++)
		if (size[i])
		{
			printf("%d square (s) of size %d\n", size[i], i);
			flag = 1;
		}
	if (!flag)printf("No completed squares can be found.\n");
}
int main(void)
{
	while (scanf("%d%d", &n, &m) == 2)
	{
		memset(size, 0, sizeof(size));
		memset(h, 0, sizeof(h));
		memset(v, 0, sizeof(v));
		for (int i = 0; i < m; i++)
		{
			char type = read();
			int x, y;
			scanf("%d%d", &x, &y);
			if (type == 'H')h[x][y] = 1;//(x,y)-(x,y+1)
			else v[y][x] = 1;//(y,x)-(y+1,x)
		}
		if (kase)printf("\n**********************************\n\n");
		printf("Problem #%d\n\n", ++kase);
		find(); 
	}
	return 0;
}