Pagini recente » Cod sursa (job #1927134) | Cod sursa (job #2399658) | Cod sursa (job #1940413) | Cod sursa (job #3155375) | Cod sursa (job #189092)
Cod sursa(job #189092)
#include<stdio.h>
#include<math.h>
#define NMAX 1500
#define DIF 0.001
struct pct{ double x,y;};
pct v[NMAX];
void poz(int stg,int dr,int &piv){
int i=stg,j=dr,d=0;
pct aux;
while(i<j){
if(v[i].x>v[j].x||v[i].x==v[j].x&&v[i].y>v[j].y){
aux=v[i];v[i]=v[j];v[j]=aux;d=1-d;
}
i+=d;
j-=1-d;
}
piv=i;
}
void qsort(int li,int ls){
int piv;
if(li<ls){
poz(li,ls,piv);
qsort(li,piv-1);
qsort(piv+1,ls);
}
}
int main(){
freopen("triang.in","r",stdin);
freopen("triang.out","w",stdout);
int i,j,k,n,nrtr=0,up,up2;
double x,y,d1,d1p,dx,dy,r3=sqrt(3),dx2,dy2,d2p,dx3,dy3,d3p,dxop;
scanf("%d",&n);
for(i=0;i<n;i++) {scanf("%lf%lf",&x,&y);v[i].x=x;v[i].y=y;}
qsort(0,n-1);
for(i=0;i<n-2;i++){
for(j=i+1;j<n-1;j++){
dx=v[j].x-v[i].x;
if(v[j].y>v[i].y) {up=1;dy=v[j].y-v[i].y;}
else {up=0;dy=v[i].y-v[j].y;}
if(up&&dy<dx/r3-DIF||!up&&dy>dx/r3+DIF) continue;
d1p=dx*dx+dy*dy; d1=sqrt(d1p);
for(k=j+1;k<n;k++){
dx2=v[k].x-v[i].x;
if(v[k].y>v[i].y) {up2=1;dy2=v[k].y-v[i].y;}
else {up2=0;dy2=v[i].y-v[k].y;}
if(dx>0) dxop=dx/2+(dy/2+dy2)*dy/dx;
else dxop=d1*r3;
if(dx2<dxop-DIF) continue;
if(dx2>d1+DIF) break;
d2p=dx2*dx2+dy2*dy2;
if(d2p>d1p+DIF||d2p<d1p-DIF) continue;
dx3=v[k].x-v[j].x;
if(up) dy3=v[j].y-v[k].y;
else dy3=v[k].y-v[j].y;
d3p=dx3*dx3+dy3*dy3;
if(d3p>d1p+DIF||d3p<d1p-DIF) continue;
else nrtr++;
}
}
}
printf("%d",nrtr);
return 0;
}