1858501_ac_31ms_96k.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <stdlib.h>
int cmp(const long *a, const long *b)
{
 return *a - *b;
}

void main()
{
 int n, c;
 int i, j;
 long tmpx, tmpy;
 long x[10001], y[10001];
 
 scanf("%d",&c);
 while(c--)
 {
  scanf("%d",&n);
  for(i = 0; i < n; i++)
  scanf("%ld%ld",&x[i],&y[i]);
  qsort(x,n,sizeof(x[0]),cmp);
  qsort(y,n,sizeof(y[0]),cmp);
  tmpx = x[0] + x[n-1];
  tmpy = y[0] + y[n-1];
  for(i = 0; i <= n / 2; i++)
     if(x[i] + x[n-i-1]!=tmpx||y[i]+y[n-i-1]!=tmpy)
        {printf("no\n");goto k;}
  printf("yes\n");
  k : ;
  }
}