fork download 
  1. #include <iostream>
  2. #include <vector>
  3. #include <queue>
  4. using namespace std;
  5. const int N=20000;
  6.  
  7. vector<int> adj[N];
  8. int odl[N];
  9.  
  10.  
  11.  
  12. void bfs(int n){
  13.  
  14.  
  15. 	for(int i=0; i<N; i++)
  16. 	odl[i]=-1;
  17. 	odl[n]=0;
  18.  
  19. 	queue<int> kol;
  20. 	kol.push(n);
  21. 	while(!kol.empty()){
  22. 		int a=kol.front();
  23. 		kol.pop();
  24. 		for(int o: adj[a]){
  25. 			if(odl[o]==-1){
  26. 			odl[o]=odl[a]+1;
  27. 			kol.push(o);}
  28. 		}
  29.  
  30.  
  31.  
  32.  
  33.  
  34. 	}
  35.  
  36.  
  37. }
  38.  
  39.  
  40.  
  41. int main() {
  42. 	ios_base::sync_with_stdio(0);
  43. 	cin.tie(0);
  44.  
  45. 	int n,m;
  46. 	cin>>n>>m;
  47. 	for(int i=1; i<2*max(m,n); i++)
  48. 	{
  49.  
  50. 		adj[i].push_back(2*i);
  51. 		adj[i].push_back(i-1);}
  52.  
  53.  
  54. 	bfs(n);
  55.  
  56. 	cout<<odl[m]<<" ";
  57.  
  58.  
  59. 	return 0;
  60. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin 
4 6
stdout 
2
https://ideone.com/TOmIKQ
language:
C++14 (gcc 8.3)
created:
7 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!