Tiling UVALive

Tiling UVALive - 6046

题目链接：https://cn.vjudge.net/problem/UVALive-6046

#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <math.h>using namespace std;struct node{    int x,y;}a[100010];int gcd(int m,int n){    while (n != 0)    {        int t = m % n;        m = n;        n = t;    }    return m;}int main(){    int t;    int tt=1;    scanf("%d",&t);    while(t--){        for (int i=0;i<3;i++){            scanf("%d%d",&a[i].x,&a[i].y);        }        int aa[10];        aa[0]=fabs(a[0].x*a[1].y-a[1].x*a[0].y);        aa[1]=fabs(a[0].x*a[2].y-a[2].x*a[0].y);        aa[2]=fabs(a[1].x*a[2].y-a[2].x*a[1].y);        sort(aa,aa+3);        int ss=gcd(aa[2],aa[1]);        if (ss>aa[0]){            int qq=gcd(ss,aa[0]);            printf("Case #%d: %d\n",tt++,qq);        }        else{            int qq=gcd(aa[0],ss);            printf("Case #%d: %d\n",tt++,qq);        }    }    return 0;}