<div id="readability-page-1" class="page"><div data-language="cpp"><pre><code>#include &lt;bits/stdc++.h&gt;
using namespace std;

int main()
{
 int n, k;
 cin &gt;&gt; n &gt;&gt; k;
 int dist[100002];
 fill(dist, dist+100001, -1);
 dist[n] = 0;
 queue&lt;int&gt; q;
 q.push(n);
 while(dist[k] == -1) {
 int cur = q.front();
 q.pop();
 for(int next : {cur-1, cur+1, cur*2}) {
 if(next &lt; 0 || next &gt; 100000) continue;
 if(dist[next]!=-1) continue;
 dist[next] = dist[cur] + 1;
 q.push(next);
 } 
 }
 cout &lt;&lt; dist[k];
 return 0;
}</code></pre></div></div>

Seulog💘

이예슬

#include <bits/stdc++.h>
using namespace std;
int main()
{
 int n, k;
 cin >> n >> k;
 int dist[100002];
 fill(dist, dist+100001, -1);
 dist[n] = 0;
 queue<int> q;
 q.push(n);
 while(dist[k] == -1) {
 int cur = q.front();
 q.pop();
 for(int next : {cur-1, cur+1, cur*2}) {
 if(next < 0 || next > 100000) continue;
 if(dist[next]!=-1) continue;
 dist[next] = dist[cur] + 1;
 q.push(next);
 } 
 }
 cout << dist[k];
 return 0;
}

[벡준] Q1697

댓글