3165831_ac_125ms_484k.cc

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

#include <algorithm>
main()
{
 int n, i, j, tmpx, tmpy, x[20001], y[20001];
 
 while(scanf("%d",&n),n)
 {
  for(i = 0; i < n; i++)
  scanf("%d%d",&x[i],&y[i]);
  std::sort(x,x+n);std::sort(y,y+n);
  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("This is a dangerous situation!\n");goto k;}
  printf("V.I.P. should stay at (%.1lf,%.1lf).\n",tmpx*1.0/2.0,tmpy*1.0/2.0);
  k:;
  }
  return 0;
}