1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
//向量法
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=60;
const int inf=100000000;
int x[maxn],y[maxn];
int get_S(int i,int j,int k)
{
      return abs((x[j]-x[i])*(y[k]-y[i])-(x[k]-x[i])*(y[j]-y[i]));
}
int main()
{
    int x1,y1,x2,y2;
    int Min,Max;
    int i,j,k,n,u,T;
    scanf("%d",&T);
    while(T--){
        Min=inf;Max=-inf;
        x1=0;y1=inf;x2=0;y2=inf;
        scanf("%d%d",&n,&u);
        for(i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
        for(i=1;i<=n;i++)
           for(j=i+1;j<=n;j++)
             for(k=j+1;k<=n;k++){
               int tmp=get_S(i,j,k);               
               if(tmp==0)  continue;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX