Pagini recente » Cod sursa (job #50663) | Cod sursa (job #408491) | Cod sursa (job #1893423) | Cod sursa (job #1496417) | Cod sursa (job #1341309)
#include <fstream>
#include <algorithm>
#include <float.h>
#define INFINIT FLT_MAX
using namespace std;
int n,i,j,k,nr;
long long total;
double pante[1000001],aux;
struct pcte{int x,y;};
pcte v[1001];
float abs (float a, float b) {
if (a > b)
return a - b;
else
return b - a;
}
int main(){
ifstream in ("trapez.in");
ofstream out("trapez.out");
in>>n;
for(i=1;i<=n;i++)
in>>v[i].x>>v[i].y;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[i].x-v[j].x!=0){
k++;
pante[k]=(v[i].y-v[j].y)*1.0/((v[i].x-v[j].x)*1.0);
}
else{
k++;
pante[k]=INFINIT;
}
sort(pante+1,pante+k+1);
aux=pante[1];nr=1;
for(i=2;i<=k;i++){
while(pante[i] == aux){
nr++;
i++;
}
if(nr>1)
total+=(nr-1)*nr/2;
aux=pante[i];
nr=1;
}
out<<total;
in.close();
out.close();
return 0;
}