Cod sursa(job #2600117)
Utilizator | Data | 11 aprilie 2020 23:35:02 | |
---|---|---|---|
Problema | Trapez | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | cex_ph_3 | Marime | 0.5 kb |
#include <fstream>
#include <cmath>
#include <unordered_map>
using namespace std;
ifstream in("trapez.in");
ofstream out("trapez.out");
unordered_map <double,int> ma;
int i,j,n,sum,x[1005],y[1005],zer;
double su1,su2;
int main()
{
in>>n;
for (i=1;i<=n;++i)
{
in>>x[i]>>y[i];
}
for (i=1;i<=n;++i)
for (j=i+1;j<=n;++j)
{
su1=y[j]-y[i];
su2=x[j]-x[i];
if (su2==0) {zer++; sum=sum+zer-1;}
else {ma[su1/su2]++;
sum=sum+(ma[su1/su2]-1);}
}
out<<sum;
return 0;
}