UVA 10556 Biometrics

点击打开链接

解法：

呵呵   double精度问题暴力旋转匹配没法过

也许高精度可以  没试过

参考了大牛的博客

改用整形推公式过了

 

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
struct point
{
    int x,y;
    point(int x=0,int y=0):x(x),y(y){}
};
point operator-(point a,point b){return point(a.x-b.x,a.y-b.y);}
point operator+(point a,point b){return point(a.x+b.x,a.y+b.y);}
int length(point a){return a.x*a.x+a.y*a.y;}
int cross(point a,point b){return a.x*b.y-a.y*b.x;}
int n;
point p1[20],p2[20],p3[20];
int main()
{
	while(scanf("%d",&n)&&n){
        for(int i=0;i<n;i++)
            scanf("%d%d",&p1[i].x,&p1[i].y);
        for(int i=0;i<n;i++)
            scanf("%d%d",&p2[i].x,&p2[i].y);
        for(int i=0;i<n;i++)
            p3[i]=p1[0]+(p2[i]-p2[0]);
        int flag=1;
        point a0=p3[1]-p3[0],b0=p1[1]-p1[0];
        for(int i=0;i<n;i++)
        {
            point a1=p3[i]-p3[0],b1=p1[i]-p1[0];
            if(length(a1)*length(b0)==length(b1)*length(a0)&&
               cross(a0,b0)*cross(a0,b0)*length(a1)*length(b1)==cross(a1,b1)*cross(a1,b1)*length(a0)*length(b0))
                continue;
            flag=0;
            break;
        }
        if(flag) puts("similar");
		else puts("dissimilar");
    }
    return 0;
}