Pagini recente » Cod sursa (job #1574270) | Cod sursa (job #314955) | Cod sursa (job #1728880) | Cod sursa (job #2389158) | Cod sursa (job #395619)
Cod sursa(job #395619)
#include<stdio.h>
#include<algorithm>
using namespace std;
int cmp(int a,int b){
return(a>b);
}
int main()
{
freopen("trapez.in","r",stdin);
freopen("trapez.out","w",stdout);
int n,x,y,i,j,a[1001],b[1001],k,o=1,s=0,nr=0;
double v[500500],aux;
scanf("%d",&n);
for(k=1;k<=n;k++){
scanf("%d%d",&x,&y);
a[o]=x;
b[o]=y;
o++;
}
k=1;
for(i=1;i<n;i++){
for(j=i+1;j<=n;j++){
if(a[j]==a[i]){
v[k]=9999;
k++;
}else{
if(b[j]==b[i]){
v[k]=99999;
k++;
}else{
v[k]=(double)(b[j]-b[i])/(double)(a[j]-a[i]);
k++;
}
}
}
}
for(i=1;i<k;i++){
for(j=i+1;j<=k;j++){
if(v[i]==v[j]){
nr++;
}
}
}
printf("%d",nr);
return 0;
}