Pagini recente » Cod sursa (job #1422138) | Cod sursa (job #2399879) | Cod sursa (job #155571) | Cod sursa (job #2922310) | Cod sursa (job #3331572)
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
ifstream fin("patrate3.in");
ofstream fout("patrate3.out");
const int NMAX = 1000;
const int INF = 2e9;
int n, answer;
int x[NMAX + 1], y[NMAX + 1];
map<pair<int, ll>, int> mp;
int get_slope(int x1, int y1, int x2, int y2) {
if(x2 - x1 == 0) {
return INF;
}
return (y2 - y1) / (x2 - x1);
}
ll get_distance(int x1, int y1, int x2, int y2) {
return (ll)(x2 - x1) * (x2 - x1) + (ll)(y2 - y1) * (y2 - y1);
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++) {
ld xx, yy;
fin >> xx >> yy;
x[i] = round(xx * 10000);
y[i] = round(yy * 10000);
}
for(int i = 1; i <= n; i++) {
for(int j = i + 1; j <= n; j++) {
int slope = get_slope(x[i], y[i], x[j], y[j]);
ll dist = get_distance(x[i], y[i], x[j], y[j]);
mp[{slope, dist}]++;
}
}
for(int i = 1; i <= n; i++) {
for(int j = i + 1; j <= n; j++) {
int slope = get_slope(x[i], y[i], x[j], y[j]);
ll dist = get_distance(x[i], y[i], x[j], y[j]);
answer += (mp[{slope, dist}] - 1);
}
}
fout << answer / 4 << '\n';
return 0;
}