Advertisement
Guest User

Untitled

a guest
Apr 15th, 2019
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.84 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3.  
  4. using namespace std;
  5.  
  6.  
  7. int n4[1000000];
  8. int ci[111][111],n2[1000000],n3[1000000];
  9. bool bo[1400][1400],bo1[100000],bo2[100000],used[100000];
  10. char ch[150000],ch1[1000][1000],tz[1000000];
  11. vector< int > v;
  12.  
  13.  
  14. void dfs(int x)
  15. {
  16. used[x] = true;
  17. for(int y = 1; y <= n; y++){
  18. if(c[x][y] == 0){ // agar ki rebro nabowa
  19. continue;
  20. }
  21.  
  22. if(used[x] == 1){ // agar ki i verwina uje raftagi bowem
  23. continue;
  24. }
  25.  
  26. dfs(y);
  27. }
  28. }
  29.  
  30. int main()
  31. {
  32. freopen("input.txt", "r", stdin);
  33. freopen("output.txt", "w", stdout);
  34. int n,s;
  35. cin>>n>>s;
  36. for( int i=0; i<n; i++ ){
  37. for( int i=0; i<n; i++ ){
  38. cin>>c[i][j];
  39. }
  40. }
  41. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement