Advertisement
VictoriaLodochkina

sacod lab 4_2 part noorination

Feb 22nd, 2021
736
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.66 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. #include <string.h>
  4.  
  5. #define MAX 101
  6.  
  7.  
  8.  
  9. int i, j, n, c, Edges;
  10.  
  11. int g[MAX][MAX], used[MAX];
  12.  
  13.  
  14.  
  15. void dfs(int v)
  16.  
  17. {
  18.  
  19.     used[v] = 1;
  20.  
  21.     c++;
  22.  
  23.     for (int i = 1; i <= n; i++)
  24.  
  25.         if (g[v][i] && !used[i]) dfs(i);
  26.  
  27. }
  28.  
  29.  
  30.  
  31. int main(void)
  32.  
  33. {
  34.  
  35.     scanf("%d", &n); Edges = c = 0;
  36.  
  37.     memset(used, 0, sizeof(used));
  38.  
  39.  
  40.  
  41.     for (i = 1; i <= n; i++)
  42.  
  43.         for (j = 1; j <= n; j++)
  44.  
  45.         {
  46.  
  47.             scanf("%d", &g[i][j]);
  48.  
  49.             Edges += g[i][j];
  50.  
  51.         }
  52.  
  53.  
  54.  
  55.     dfs(1);
  56.  
  57.     Edges /= 2;
  58.  
  59.  
  60.  
  61.     if ((Edges == n - 1) && (c == n)) printf("YES\n");
  62.  
  63.     else printf("NO\n");
  64.  
  65. }
  66.  
  67.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement