c语言随机生成凸多边形源代码,求能够包含随机产生的点的边数最少的凸多边形...

求能够包含随机产生的点的边数最少的凸多边形

各位大虾，帮忙看看这个程序有什么错误好吗？？？？？？

#include "stdio.h"

#include "math.h"

#include "time.h"

#include "dos.h"

#define N 100

#define M 10

#define P 10

typedef float F;

typedef struct

{F x;

F y;

int n;

}DT;

typedef struct

{F z;

F m;

}AT;

int suiji()

{long int i,a;

struct time t;

gettime(&t);

a=t.ti_hour*1000000+t.ti_min*10000+t.ti_sec*100+t.ti_hund;

i=a%N;

return(i);

}

F jiefc(F x1,F y1,F x2,F y2,F x)

{F y;

y=abs(((y2-y1)/(x2-x1))*(x-x1));

return(y);

}

F tn(F x1,F y1,F x2,F y2)

{F n;

n=abs((y1-y2)/(x1-x2));

return(n);

}

main()

{int i,j,k,q,f,b1,n,n2,t1,t2,p1,p2,n1,q1,f1;

static int e[4];

F x2,y2,p3,p4,t;

DT b[4][N],a[N];

AT g,x[4],y[4];

struct wo

{F s;

int p;

} d[4][N];

n=suiji()%P+1;

for(i=0;i

{t1=suiji();

t2=suiji();

p3=(F)(t1)/M;

p4=(F)(t2)/M;

a[i].x=p3;

a[i].y=p4;

a[i].n=i+1;

}

for(i=0;i

{if(a[i].x>a[i+1].x) x[0].z=x[1].z=a[i+1].x;

if(a[i].x

if(a[i].y>a[i+1].y) y[0].m=x[1].m=a[i+1].y;

if(a[i].y