Cod sursa(job #2246873)
| Utilizator | Data | 27 septembrie 2018 17:33:22 | |
|---|---|---|---|
| Problema | Trapez | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("trapez.in");
ofstream g("trapez.out");
int n,nr,sol;
double v[1000004],x[1001],y[1001];
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>x[i]>>y[i];
for(int i=1;i<n;++i)
{
for(int j=i+1;j<=n;++j)
{
if(x[i]==x[j])
{
v[++nr]=99999999999;
}
else
v[++nr]=(y[j]-y[i])/(x[j]-x[i]);
}
}
sort(v+1,v+nr+1);
for(int i=1;i<nr;++i)
{
int a=1;
while(v[i]==v[i+1])
a++,i++;
sol+=(a*(a-1)/2);
}
g<<sol;
}
