1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57
|
#define N 10 struct { char type; double x1, y1, x2, y2, r;
}shape[N]; int main() { char c; int count = 0; while ((c = getchar()) != '*') { shape[count].type = c; if (c == 'r') scanf("%lf%lf%lf%lf", &shape[count].x1, &shape[count].y1, &shape[count].x2, &shape[count].y2); else scanf("%lf%lf%lf", &shape[count].x1, &shape[count].y1, &shape[count].r);
count++; getchar(); }
bool in; int i = 0; double x, y; while (scanf("%lf%lf", &x, &y) && x != 9999.9&&y != 9999.9) { in = false; i++; for (int j = 0; j<count; j++) { if (shape[j].type == 'r') { if (x > shape[j].x1&&x < shape[j].x2&&y<shape[j].y1&&y > shape[j].y2) { printf("Point %d is contained in figure %dn", i, j+1); in = true; } } else { double dis2 = (x - shape[j].x1)*(x - shape[j].x1) + (y - shape[j].y1)*(y - shape[j].y1); if (dis2 < shape[j].r*shape[j].r) { printf("Point %d is contained in figure %dn", i, j+1); in = true; } } }
if (!in) printf("Point %d is not contained in any figuren", i); } return 0; }
|
近期评论