[백준 2606] 바이러스

[백준 2606] 바이러스

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

#include < iostream > using namespace std ; int graph[ 101 ][ 101 ]; bool visited[ 101 ]; int n; int dfs( int start) { visited[start] = true ; int result = 1 ; for ( int i = 0 ; i < = n; + + i) { if ( 1 = = graph[start][i] & & false = = visited[i]) { result + = dfs(i); } } return result; } int main() { int m; cin > > n > > m; for ( int i = 0 ; i < m; + + i) { int a, b; cin > > a > > b; graph[a][b] = 1 ; graph[b][a] = 1 ; } cout < < dfs( 1 ) - 1 ; return 0 ; } Colored by Color Scripter

from http://app-le.tistory.com/24 by ccl(A) rewrite - 2021-10-18 20:26:56