민듀의 일상

https://www.acmicpc.net/problem/2606#include #include using namespace std;int N, M;int cnt = 0;vector> v;int visited[101];void dfs(int now) { cnt++; for (int i = 0; i > N >> M; v.resize(N + 1); for (int i = 0; i > a >> b; v[a].push_back(b); v[b].push_back(a); } visited[1] = 1; dfs(1); cout

https://www.acmicpc.net/problem/1260 #include #include #include #include using namespace std;int N, M, start;vector> v;int used[1001];int printed[1001];void dfs(int now) { cout q; used[start] = 1; q.push(start); while (!q.empty()) { int now = q.front(); q.pop(); cout > N >> M >> start; v.resize(N + 1); for (int i = 0; i > a >> b; v[a].push_back(b); v[b].push_back(a); } for (int i = 0; i