Pagini recente » Cod sursa (job #302611) | Cod sursa (job #3239942) | Cod sursa (job #3211593) | Cod sursa (job #675959) | Cod sursa (job #2735498)
#include <bits/stdc++.h>
using namespace std;
int main() {
freopen("patrate3.in", "r", stdin);
freopen("patrate3.out", "w", stdout);
int n;
scanf("%d", &n);
vector<pair<int, int>> p(n);
auto get = []() {
int x = 0, y = 0;
scanf("%d.%d", &x, &y);
return x * 10000 + y;
};
for (int i = 0; i < n; ++i) {
p[i].first = get();
p[i].second = get();
}
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
int x = p[i].first + p[j].first;
int y = p[i].second + p[j].second;
v.push_back({x, y});
}
}
sort(v.begin(), v.end());
long long ans = 0;
for (int i = 0; i < v.size();) {
int j = i;
while (j < v.size() && v[i] == v[j]) j++;
ans += (j - i) *1ll* (j - i - 1) / 2;
i = j;
}
printf("%lld\n", ans);
return 0;
}