Pagini recente » Monitorul de evaluare | Cod sursa (job #3222873)
#include <fstream>
#include <algorithm>
#include <set>
using namespace std;
#define int long long
ifstream in("trapez.in");
ofstream out("trapez.out");
int n, ans;
pair<int, int> v[1005];
multiset<pair<pair<int, int>, int>> s;
signed main()
{
in>>n;
for(int i = 1; i<=n; i++)
{
in>>v[i].first>>v[i].second;
}
int dx, dy, gcd, sgn;
for(int i = 1; i<=n; i++)
{
for(int j = i + 1; j<=n; j++)
{
dx = v[i].first - v[j].first;
dy = v[i].second - v[j].second;
if(dx * dy > 0)
{
sgn = 1;
}
else
{
sgn = -1;
}
gcd = __gcd(dx, dy);
dx /= gcd;
dy /= gcd;
s.insert({{dx, dy}, sgn});
}
}
out<<ans;
return 0;
}