Массивы структур - C++ - Ответ 4191657

#include <iostream>
#include <fstream>
#include <cstdlib>
 
using namespace std;
 
struct TPoint
{
   int x, y;
};
 
struct TSegment
{
   TPoint a, b;
};
 
//----------------------------------------------//
void PrintSegment(const TSegment& segment)
{
   cout << "{[" << segment.a.x << "," << segment.a.y << "],"
        << "["  << segment.b.x << "," << segment.b.y << "]}";
}
//----------------------------------------------//
void PrintAllSegments(TSegment* array, size_t size)
{
   for (size_t i = 0; i < size; ++i)
   {
      PrintSegment(array[i]);
      cout << endl;
   }
}
//----------------------------------------------//
bool Intersection(const TSegment& one, const TSegment& two)
{
   int v1 = (two.b.x-two.a.x)*(one.a.y-two.a.y) - (two.b.y-two.a.y)*(one.a.x-two.a.x);
   int v2 = (two.b.x-two.a.x)*(one.b.y-two.a.y) - (two.b.y-two.a.y)*(one.b.x-two.a.x);
   int v3 = (one.b.x-one.a.x)*(two.a.y-one.a.y) - (one.b.y-one.a.y)*(two.a.x-one.a.x);
   int v4 = (one.b.x-one.a.x)*(two.b.y-one.a.y) - (one.b.y-one.a.y)*(two.b.x-one.a.x);
 
   return ((v1*v2 < 0) && (v3*v4 < 0));
}
//----------------------------------------------//
void PrintIntersection(TSegment* array, size_t size)
{
   for (size_t i = 0; i < size-1; ++i)
   {
      for (size_t j = i+1; j < size; ++j)
      {
         if (Intersection(array[i], array[j]))
         {
            PrintSegment(array[i]);
            cout << " and ";
            PrintSegment(array[j]);
            cout << endl;
         }
      }
   }
}
//----------------------------------------------//
 
int main(int argc, const char* argv[])
{
   if (argc != 2)
   {
      cerr << "Usage: program.exe <FILE.txt>" << endl;
      system("PAUSE");
      return 1;
   }
 
   ifstream f(argv[1]);
 
   if (!f.is_open())
   {
      cerr << "Error: file " << argv[1] << " not opened ..." << endl;
      return 1;
   }
 
   size_t size;
   f >> size;
 
   TSegment* array = new TSegment[size];
 
   for (size_t i = 0; (i < size) && !f.eof(); ++i)
   {
      f >> array[i].a.x >> array[i].a.y >> array[i].b.x >> array[i].b.y;
   }
 
   f.close();
 
   PrintAllSegments(array, size);
 
   cout << endl << "intersecting:" << endl;
   PrintIntersection(array, size);
 
   delete[] array;
 
   return 0;
}