The Troubles of Lmy

The Troubles of Lmy

---

Time Limit:1s	Memory limit:32M
Accepted Submit:46	Total Submit:126

---

Lmy is the lovely cousin of zmq, and she's a junior high school student. One day she came back from school. Zmq: What did you learn in your class today? Lmy: Similar triangle. Zmq: Well, fine, have you mastered it? Lmy: Sure, that's a piece of cake. Zmq: OK, well, let me test you to see whether you have thoroughly understood the conception of being similar. I'll draw two Arbitrary Polygons, and you have to tell me whether they are similar or not. If you are right, I'll take you out. Lmy: ...... It seems that little lmy got into troubles. Can you help her out by designing a program? Input There are several test cases in the input. The first line of each case is an n (3 ≤ n ≤ 300), indicating that each polygon has n points. And in the following 2n lines, each line represents a point. The first n point represents the first polygon in anti-clockwise order, and so the second. Please note that all the polygons are simple. You can try to rotate them, then tell whether they are similar or not. Output For each case, output "Yes" or "No", showing whether they are similar. Sample Input 3 0 0 1 1 0 1 0 0 2 2 0 2 3 0 0 1 1 0 1 0 0 2 2 0 1 Sample Output Yes No

http://acm.fzu.edu.cn/problem.php?pid=1785

 

求多边形相似的问题，如果对应的每一条边的倍数关系相同则相似

 

 

#include<cstdio> int main() { int a[301][3],b[300][3]; int i,j,n,k,flag; double c[301]; while(scanf("%d",&n)!=EOF) { flag=0; k=0; for(i=0;i<n;i++) scanf("%d%d",&a[i][0],&a[i][1]); for(i=0;i<n;i++) scanf("%d%d",&b[i][0],&b[i][1]); for(i=0;i<n;i++) { for(j=0;j<2;j++) { if(a[i][j]==0&&b[i][j]!=0) flag=1; if(a[i][j]!=0&&b[i][j]==0) flag=1; if(a[i][j]!=0&&b[i][j]!=0) c[k++]=(double)a[i][j]/(double)b[i][j]; } } for(i=0;i<k-1;i++) if(c[i]!=c[i+1]) {flag=1;break;} if(flag) printf("No/n"); else printf("Yes/n"); } return 0; }