транзитивность доделать

#include <iostream>
#include <cmath>

using namespace std;

int check (int **matriza, int n)
{
  int shet, s = 0;
   for ( int i = 0; i < n-2; i++)
     for (int j = i+2; j < n-1; j++)
      for (int s = j+1; s < n; s++)
      if (matriza[i][j] == 1 && matriza[j][s] == 1 && matriza[i][s] != 1 && i != s != j)
       shet++;

  return shet;
}

void povorot(int **arr, int n)
{
  for (int i=0; i < n-1; i++)
    for (int j=i+1; j < n; j++)
        swap (arr[i][j], arr[j][i]);
}

int main()
{
  int n, shet = 0;
  cin >> n;
  int **matriza = new int*[n];

  for (int i = 0; i <n; i++)
  matriza[i] = new int[n];

  for ( int i = 0; i < n; i++)
   for (int j = 0; j < n; j++)
    cin >> matriza[i][j];

  shet = check(matriza, n);
  if (shet == 0)
   {
     povorot(matriza, n);
     shet = check(matriza, n);
   }

  if (shet == 0)
    cout << 1;
    else cout << 0;
}