15:I[42907,["401","static/chunks/363642f4-812e50cc3e323d2c.js","213","static/chunks/213-b2337299901a9046.js","152","static/chunks/152-6ad5ee8e457afbb4.js","393","static/chunks/393-460011df65777e34.js","659","static/chunks/app/codes/%5Bid%5D/page-f39212c89e2a3314.js"],"CodeViewer"] 16:T652,#include #include #include #include #include #include #include #include using namespace std; struct Q { int time; int pos; }; int main() { int n, k; cin >> n >> k; if (n == k) { cout << 0; return 0; } deque q; q.push_back({ 0, n }); bool visits[200002] = { false, }; visits[n] = true; while (!q.empty()) { Q current = q.front(); q.pop_front(); if (current.pos * 2 >= 0 && current.pos * 2 < 200002 && !visits[current.pos * 2]) { if (current.pos * 2 == k) { cout << current.time; break; } q.push_front({ current.time, current.pos * 2 }); visits[current.pos * 2] = true; } if (current.pos - 1 >= 0 && current.pos - 1 < 200002 && !visits[current.pos - 1]) { if (current.pos - 1 == k) { cout << current.time + 1; break; } q.push_back({ current.time + 1, current.pos - 1 }); visits[current.pos - 1] = true; } if (current.pos + 1 >= 0 && current.pos + 1 < 200002 && !visits[current.pos + 1]) { if (current.pos + 1 == k) { cout << current.time + 1; break; } q.push_back({ current.time + 1, current.pos + 1 }); visits[current.pos + 1] = true; } } return 0; } 5:["$","div",null,{"className":"container mx-auto px-4","children":[["$","h1",null,{"className":"mb-4 text-2xl font-bold","children":["코

코드 #521