Pagini recente » Cod sursa (job #2710245) | Cod sursa (job #2717634) | Cod sursa (job #196570) | Cod sursa (job #655281) | Cod sursa (job #3278008)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("trapez.in");
ofstream fout("trapez.out");
#define ld long double
#define int long long
const int NMAX = 1005;
struct point {ld x, y;} a[NMAX];
unordered_map<ld, int> unghiuri;
signed main()
{
int n;
fin >> n;
for(int i = 1; i <= n; i++)
fin >> a[i].x >> a[i].y;
for(int i = 1; i <= n; i++)
{
for(int j = i + 1; j <= n; j++)
{
if(a[j].x == a[i].x)
continue;
ld tg = (a[j].y - a[i].y) / (a[j].x - a[i].x);
unghiuri[tg]++;
}
}
int cnt = 0;
for(auto i : unghiuri)
cnt += i.second * (i.second - 1) / 2;
fout << cnt;
return 0;
}