
Problem Solving/BaekJoon
[BOJ/백준] 17352 - 여러분의 다리가 되어 드리겠습니다!
> N; initRoot(N); for(int n = 0 ; n > from >> to; unionRoot(from, to); } int tmp = findRoot(1); for(int n = 2 ; n
> N; initRoot(N); for(int n = 0 ; n > from >> to; unionRoot(from, to); } int tmp = findRoot(1); for(int n = 2 ; n