CSP/CCF回收站选址（C)

题目：CSP/CCF回收站选址

思路：先判断这个点的上下左右有无垃圾，然后再判断左上，左下，右上，右下有无垃圾，进行评分
代码：

#include<stdio.h>
#define N 1000
int main() {
	int n;
	int x[N], y[N];
	int i,j,k,flag=0,flag1=0;
	int count0=0, count1 = 0, count2 = 0, count3 = 0, count4 = 0;
	while (1) {
		scanf_s("%d", &n);
		if (1 <= n && n <= 1000) {
			break;
		}
	}
	for (i = 0;i < n;i++) {
		while (1)
		{
			scanf_s("%d%d", &x[i], &y[i]);
			if (x >= 0 && y <= 1000000000)
			{
				break;
			}
		}
	}
	for (i = 0;i < n;i++) {
		flag = 0;flag1 = 0;
		for (j = 0;j < n;j++) {
			if ((x[i] == x[j] && y[i] + 1 == y[j]) || (x[i] == x[j] && y[i] - 1 == y[j]) || (x[i] - 1 == x[j] && y[i] == y[j]) || (x[i] + 1 == x[j] && y[i] == y[j]))
			{
				flag++;
			}
		}
		if (flag == 4) {
			for (k = 0;k < n;k++) {//开始计算分数0~4
				if ((x[i] - 1 == x[k] && y[i] + 1 == y[k]) || (x[i] - 1 == x[k] && y[i] - 1 == y[k]) || (x[i] + 1 == x[k] && y[i] + 1 == y[k]) || (x[i] + 1 == x[k] && y[i] - 1 == y[k]))
				{
					flag1++;
				}
				
			}
			//printf("%d\n", flag1);
			switch (flag1) {
			case 0:
				count0++;
				break;
			case 1:
				count1++;
				break;
			case 2:
				count2++;
				break;
			case 3:
				count3++;
				break;
			case 4:
				count4++;
				break;
			}
		}
	}
	printf("%d\n%d\n%d\n%d\n%d", count0, count1, count2, count3, count4);
}

运行结果截图：