478_2

<br /> /* <br /> "Points in Figures: Rectangles, Circles and Triangles"<br /> Level:5.0<br /> Date:2006/9/11<br /> 技巧：<br /> 　長方形的判斷: x > 左上角的x && x < 右下角的x && y < 左上角的y && y > 右下角的y<br /> 圓形的判斷: (x - 圓心的x)^2 + (y - 圓心的y)^2 < 半徑^2 三角形的判斷:利用向量判斷是否線段相交, 不但較快, 也較省記憶體. */ #include <stdio.h><br /> #include <math.h><br /> <br /> struct shape{<br /> char kind; //rectangle, circle or triangle<br /> double x1;<br /> double y1;<br /> double x2;<br /> double y2;<br /> double x3;<br /> double y3;<br /> double radius;<br /> }s[10];<br /> <br /> double cross(double x1, double y1, double x2, double y2);<br /> <br /> main(){<br /> const float epsilon = 0.000001; <br /> double t1,t2,t3,t0; <br /> int i;<br /> int no=1;<br /> bool contain = false;<br /> int len = 0;<br /> double x,y;<br /> char temp;<br /> while(scanf("%c",&temp)){<br /> if(temp == 'r'){<br /> scanf("%lf %lf %lf %lf",&s[len].x1,&s[len].y1,<br /> &s[len].x2,&s[len].y2);<br /> s[len].kind = 'r'; <br /> s[len].radius = 0;<br /> s[len].x3 = 0;<br /> s[len].y3 = 0;<br /> len++;<br /> }<br /> else if (temp == 'c'){<br /> scanf("%lf %lf %lf", &s[len].x1, &s[len].y1, &s[len].radius);<br /> s[len].kind = 'c';<br /> s[len].x2 = s[len].y2 = s[len].x3 = s[len].y3 = 0;<br /> len++;<br /> } <br /> else if (temp == 't'){<br /> scanf("%lf %lf %lf %lf %lf %lf", &s[len].x1, &s[len].y1, <br /> 　　　　　　　　　&s[len].x2, &s[len].y2, &s[len].x3, &s[len].y3);<br /> s[len].kind = 't';<br /> s[len].radius = 0;<br /> len++;<br /> } <br /> else if(temp == '*')<br /> break; <br /> }<br /> while(scanf("%lf %lf",&x,&y)){<br /> if(x == 9999.9 && y == 9999.9)<br /> break;<br /> for(i=0;i<len;i++){ //test whether if point contained in any shap. if(s[i].kind == 'r' && x > s[i].x1 && x < s[i].x2 && y < s[i].y1 && y > s[i].y2){<br /> printf("Point %d is contained in figure %d\n",no,i+1);<br /> contain = true; <br /> }<br /> else if (s[i].kind == 'c' && <br /> 　　　　　　　　　　(x-s[i].x1)*(x-s[i].x1)+(y-s[i].y1)*(y-s[i].y1) <br /> 　　　　　　　　　　　< s[i].radius * s[i].radius){ printf("Point %d is contained in figure %d\n",no,i+1); contain = true; } else if (s[i].kind == 't'){ if(cross(x - s[i].x1,y-s[i].y1,s[i].x2-s[i].x1,s[i].y2-s[i].y1) * cross(s[i].x3-s[i].x1,s[i].y3-s[i].y1,s[i].x2-s[i].x1,s[i].y2-s[i].y1)>=0){<br /> <br /> if(cross(x-s[i].x2,y-s[i].y2,s[i].x3-s[i].x2,s[i].y3-s[i].y2) *<br /> cross(s[i].x1-s[i].x2,s[i].y1-s[i].y2,s[i].x3-s[i].x2,s[i].y3-s[i].y2)>=0){ <br /> <br /> if(cross(x-s[i].x3,y-s[i].y3,s[i].x1-s[i].x3,s[i].y1-s[i].y3) *<br /> cross(s[i].x2-s[i].x3,s[i].y2-s[i].y3,s[i].x1-s[i].x3,s[i].y1-s[i].y3)>=0){ <br /> printf("Point %d is contained in figure %d\n",no,i+1);<br /> contain = true;<br /> } <br /> }<br /> } <br /> } <br /> }<br /> if(contain == false)<br /> printf("Point %d is not contained in any figure\n",no);<br /> no++;<br /> contain = false; <br /> } <br /> } <br /> <br /> double cross(double x1, double y1, double x2, double y2){<br /> return x1 * y2 - y1* x2;<br /> }<br /> <br />