코딩테스트/백준
2024. 9. 9.
[백준] 13023번 : ABCDE
🔗 문제 링크https://www.acmicpc.net/problem/13023👩💻 코드#include #include using namespace std;static bool isArrive = false;void DFS(int node, vector &visited, vector> &graph, int count) { if (count == 4 || isArrive) { isArrive = true; return; } visited[node] = true; for (int i : graph[node]) { if (!visited[i]) { DFS(i, visited, graph, count+1); } ..
![[백준] 13023번 : ABCDE](http://i1.daumcdn.net/thumb/C480x320/?fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbZByi9%2FbtsJvtSaiW1%2FvJgcQzk5O1OpbwRuJ8WVZk%2Fimg.png)