1.题目描述:点击打开链接
2.解题思路:把输入的每个点作为矩形左上角,顺时针走一圈,看能否围成一个边长为len的正方形
3.代码:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>
#include<stdlib.h>
#define max 200
int n, m;
int arr[max][3];
int find(int len, int a, int x, int y)
{
if (a == 'V') return 0;
int aa = 1, bb = 1, cc = 1, dd = 1;
int k;
for (int i = y; i < y + len; i++)
{
for (k = 0; k < m; k++)
if (arr[k][0] == 'H'&&arr[k][1] == x&&arr[k][2] == i)
break;
if (k == m) aa = 0;
}
for (int i = y; i < y + len; i++)
{
for (k = 0; k < m; k++)
if (arr[k][0] == 'H'&&arr[k][1] == x + len&&arr[k][2] == i)
break;
if (k == m) bb = 0;
}
for (int i = x; i