南邮23考研复试上机NOJ官方题库 [1018华强种瓜] C语言实现

Giga_heart

已于 2023-03-21 15:29:18 修改

阅读量953

点赞数 4

文章标签：考研 c语言算法

于 2023-03-21 15:28:46 首次发布

本文链接：https://blog.csdn.net/na1ve_/article/details/129689689

版权

一、题目链接

华强种瓜

二、题目截图

$[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-tASDaTn9-1679383489256)(C:\Users\27832\AppData\Roaming\Typora\typora-user-images\image-20230320221439903.png)]$

三、代码答案：（c语言实现）

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

typedef struct point{
	int x;
	int y;
};


float distance(int x1, int y1, int x2, int y2) {
	float dis = sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
	return dis;
}

int mark[200][200];
int main() {
	int n, k, r;//n为边长，k为洒水器数量，r为洒水器工作半径
	scanf("%d %d %d", &n, &k, &r);

	struct point* points = (struct point*)malloc(sizeof(struct point) * k);
	for (int i = 0; i < k; i++) {
		scanf("%d %d", &points[i].x, &points[i].y);
	}
	

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int p = 0; p < k; p++) {
				if (distance(i, j, points[p].x, points[p].y) <= r) {
					mark[i][j] = 1;
					break;
				}
			}
		}
	}
	int result = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (mark[i][j] == 1) result++;
		}
	}
	printf("%d", result);
	return 0;
}