Pagini recente » Cod sursa (job #2568214) | Istoria paginii runda/simulareoji18 | Cod sursa (job #2644636) | Cod sursa (job #1257243) | Cod sursa (job #1429555)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("trapez.in");
ofstream g("trapez.out");
int n;
struct punct
{
long double x,y;
} v[1001];
vector <long double> sol;
int main()
{
f>>n;
for(int i=0; i<n; i++)
f>>v[i].x>>v[i].y;
f.close();
int ct=0;
for(int i=0; i<n-1; i++)
for(int j=i+1; j<n; j++)
sol.push_back((double)((v[j].y-v[i].y)/(v[j].x-v[i].x)));
int m=sol.size();
sort(sol.begin(),sol.end());
for(int i=1; i<m; i++)
if(sol.at(i)==sol.at(i-1))
ct++;
g<<ct;
}