Pagini recente » Cod sursa (job #644827) | Cod sursa (job #1375357) | Cod sursa (job #2570391) | Cod sursa (job #2107228) | Cod sursa (job #2916115)
#include <fstream>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ifstream fin("trapez.in");
ofstream fout("trapez.out");
int n;
ll x[1000], y[1000], s = 0, xd;
unordered_map<ld, ll> um;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> x[i] >> y[i];
for (int j = 0; j < i; j++) {
xd = x[j] - x[i];
if (xd != 0)
s += um[(ld)(y[j] - y[i]) / xd]++;
else
s += um[-1]++;
}
}
fout << s;
fin.close();
fout.close();
return 0;
}