Advertisement
Guest User

Untitled

a guest
Feb 25th, 2020
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.47 KB | None | 0 0
  1. #include<fstream>
  2. using namespace std;
  3. ifstream cin("arbore.in");
  4. ofstream cout("arbore.out");
  5. int n,k,a[101][101],i,x,y,viz[101],tati[101];
  6. void dfs(int k, int tata)
  7. {
  8. viz[k]=1;
  9. tati[k] = tata;
  10. for(int i=1;i<=n;i++)
  11. if(a[k][i]==1 && viz[i]==0)
  12. {
  13. dfs(i , k);
  14. }
  15. }
  16. int main()
  17. {
  18. cin>>n>>k;
  19. for(i=1;i<n;i++)
  20. {
  21. cin>>x>>y;
  22. a[x][y]=a[y][x]=1;
  23. }
  24. dfs(k,0);
  25. for(i=1;i<=n;i++)cout<<tati[i]<<" ";
  26. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement