7-10-Saving James Bond - Easy Version-编程题

解题代码

#include<stdio.h>
#include<math.h>
#define MAXN 100
#define DIA 15
#define SIDE 100
typedef enum { false, true } bool;
typedef struct array* parray;
struct array{
	int x;
	int y;
}A[MAXN];
int B[MAXN], N, D;
bool DFS(int V);
bool CanJump(int V, int i);
bool CanJumpToSide(int x, int y, double D);
bool FirstJump(int V);
int main()
{
	int i, flag = 0;
	scanf("%d %d", &N, &D);
	for (i = 0; i < N; i++) scanf("%d %d", &A[i].x, &A[i].y);
	if (CanJumpToSide(0,0,(double)DIA/2+D)) flag = 1;
	else {
		for (i = 0; i < N; i++) {
			if (!B[i] && FirstJump(i)) {
				if (DFS(i)) 
					flag = 1;
			}
		}
	}
	if (flag) printf("Yes");
	else printf("No");
	return 0;
}
bool DFS(int V) {
	B[V] = 1;
	int x = A[V].x, y = A[V].y;
	if (CanJumpToSide(x, y, (double)D)) return true;
	else {
		for (int i = 0; i < N; i++) {
			if (!B[i] && CanJump(V, i)) {
				if (DFS(i)) return true;
			}
		}
	}
	return false;
}
bool CanJump(int V, int i) {
	int x1 = A[V].x, y1 = A[V].y;
	int x2 = A[i].x, y2 = A[i].y;
	double distance = sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
	if (distance <= D) return true;
	else return false;
}
bool CanJumpToSide(int x, int y, double D) {
	if ((double)x >= (double)SIDE / 2 - D || (double)x<=(double)D - SIDE / 2 || (double)y>=(double)SIDE / 2 - D || (double)y <= (double)D - SIDE / 2) return true;
	else return false;
}
bool FirstJump(int V) {
	int x = A[V].x, y = A[V].y;
	double distance = sqrt(pow(x, 2) + pow(y, 2));
	if (distance <= (double)DIA / 2 + D) return true;
	else return false;
}

测试结果

问题整理

1.函数的return一定要覆盖所有的出口。