BFS1 BOJ[1697] 숨바꼭질 C/C++ 숨바꼭질 #define _CRT_SECURE_NO_WARNINGS #include #include #include #include int check[1000000] = { 0, }; int main() { int n, m; scanf("%d %d", &n, &m); if (n == m) { printf("0"); } else { std::queue bfs; bfs.push(n); check[n] = 1; int count = 0; while (1) { count++; int size = bfs.size(); int flag = 0; for (int i = 0; i < size; i++) { int p = bfs.front(); bfs.pop(); int a = p - 1; int b = p + 1; in.. 2024. 1. 31. 이전 1 다음
