Pagini recente » Cod sursa (job #1857970) | Cod sursa (job #2393460) | Cod sursa (job #1876146) | Cod sursa (job #907865) | Cod sursa (job #134720)
Cod sursa(job #134720)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int compare( const void* a, const void* b ) {
double* arg1 = (double*) a;
double* arg2 = (double*) b;
if( *arg1-*arg2<=-0.000000000000000000000000000001) return -1;
else if( *arg1-*arg2<=0.000000000000000000000000000001&&*arg1-*arg2>=-0.000000000000000000000000000001 ) return 0;
else return 1;
}
struct ceva
{
int x,y;
};
ceva a[1005];
double b[1000010];
int main()
{
FILE *in,*out;
int i,n,nr,nr2,j,nr3,nr4=0,nr5=0;
in=fopen("trapez.in","r");
out=fopen("trapez.out","w");
//ciur(50000);
fscanf(in,"%d",&n);
for (i=1;i<=n;i++)
fscanf(in,"%d%d",&a[i].x,&a[i].y);
nr=0;
for (i=1;i<=n;i++)
{
for (j=i+1;j<=n;j++)
{
if (a[i].y-a[j].y!=0&&a[i].x-a[j].x!=0)
{
nr++;
b[nr]=(double)(a[i].x-a[j].x)/(double)(a[i].y-a[j].y);
}
if (a[i].y==a[j].y)
nr4++;
if (a[i].x==a[j].x)
nr5++;
}
}
qsort(b+1,nr,sizeof(b[1]),compare);
nr2=(nr4-1)*nr4/2+(nr5-1)*nr5/2;
for (i=1;i<nr;i++)
{
nr3=0;
while (b[i+1]-b[i]<=0.000000000000000000000000000001)
{
nr3++;
i++;
}
nr2+=nr3//(nr3-1)*nr3/2;
}
fprintf(out,"%d\n",nr2);
fclose(in);
fclose(out);
return 0;
}