Advertisement
Guest User

Untitled

a guest
Feb 22nd, 2019
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.74 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4.  
  5. ifstream fin("conex.in");
  6. ofstream fout("conex.out");
  7.  
  8. int n , a[105][105];
  9. int x[105], // coada pentru parcurgerea in latime
  10. v[105]; // vector caracteristic care precizeaza daca un varf a fost sau nu vizitat
  11.  
  12.  
  13. int conex()
  14. {
  15. int st, dr;
  16. st = dr = 1;
  17. v[1] = 1;
  18. x[1] = 1;
  19. while(st <= dr)
  20. {
  21. int k = x[st];
  22. for(int i = 1; i <= n ; ++i)
  23. if(v[i] == 0 && a[k][i] == 1)
  24. {
  25. dr ++;
  26. v[i] = 1;
  27. x[dr] = i;
  28. }
  29. st ++;
  30. }
  31. for(int i = 1 ; i <= n ; ++i)
  32. if(v[i] == 0)
  33. return 0;
  34. return 1;
  35. }
  36.  
  37. int main()
  38. {
  39. int i , j;
  40. fin >> n;
  41. while(fin >> i >> j)
  42. {
  43. a[i][j] = a[j][i] = 1;
  44. }
  45.  
  46. if(conex())
  47. fout <<"DA";
  48. else
  49. fout << "NU";
  50.  
  51. return 0;
  52. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement