fork download
  1. #include <iostream>
  2.  
  3. int n;
  4. int mat[100][100];
  5. int map[100][100];
  6.  
  7. using namespace std;
  8.  
  9. void DFS(int cur, int num)
  10. {
  11. for (int j = 0; j < n; j++)
  12. {
  13. if (mat[num][j] == 1)
  14. {
  15. map[cur][j] = 1;
  16. if (cur != j)
  17. DFS(cur, j);
  18. else
  19. continue;
  20. }
  21. else
  22. continue;
  23. }
  24. }
  25.  
  26. int main()
  27. {
  28. cin >> n;
  29. for (int i = 0; i < n; i++)
  30. {
  31. for (int j = 0; j < n; j++)
  32. {
  33. cin >> mat[i][j];
  34. }
  35. }
  36.  
  37. for (int i = 0; i < n; i++)
  38. DFS(i,i);
  39.  
  40. cout << endl;
  41.  
  42. for (int i = 0; i < n; i++)
  43. {
  44. for (int j = 0; j < n; j++)
  45. {
  46. cout << map[i][j] << " ";
  47. }
  48. cout << endl;
  49. }
  50.  
  51. return 0;
  52. }
  53.  
Time limit exceeded #stdin #stdout 5s 8388607KB
stdin
3
0 1 1
1 0 1
1 1 0
stdout
Standard output is empty