코드 #include using namespace std; int n,m,a[100004],cnt,res; void bfs(int x) { a[x] = 1; queue q; q.push(x); while(q.size()) { int px = q.front(); q.pop(); if (px == m) { res = a[px]; cnt++; } for(int i : {px-1, px+1, px*2}) { if(i >= 100001 || i > n >> m; bfs(n); ..
