Developing.ru

Код: Выделить всё

const int N = 10; // amount of points
int x[N], y[N]; // coordinates of points

EnterCoordinates(x, y, N);

for (int i = 0; i < N-2; ++i)
{
   for (int j = i+1; i < N-1; ++j)
   {
      for (int k = j+1; k < N; ++k)
      {
         // here we are analyzing one variant from a lot of possible ones
         // three selected points have indexies: i, j, k

         // this is "for" to check all not selected points
         for (int p = 0; p < N; ++p)
         {
            if (p != i && p != j && p != k)
            {
               // if we are here then point is not selected and should be checked whether it is in the triagle <i,j,k>
            }
         }
      }
   }
}