[C++] 백준 1697 (BFS풀이)

문제 소스 코드 #include <iostream> #include <queue> #include <vector> using namespace std; int visited[100001] = {0}; int main() { queue<pair<int,int>> q; int N, K; scanf("%d %d", &N, &K); q.push({N,0}); while(q.size() != 0) { int front = q.front().first; int level = q.front().second; visited[front] = 1; if(front == K) break; q.pop(); if(front-1 >= 0 && !visited[front-1]) q.push({front-1, level+1}); if(front+1 < 100001 && !visited[front+1]) q.push({front+1, level+1}); if(front*2 < 100001 && !visited[f...

원문링크 : [C++] 백준 1697 (BFS풀이)