For this Question: You are given two integers, A and B. You want to transform A to B by performing a sequence of operations. You can only perform the following operations:
• Divide A by two, but only if A is even.
• Add one to A.
What is the minimum number of operations you need to transform A into B?The input will be a single line containing two integers A and B.

Constraints
1 <= A, B <= 1000000000On a single line write the minimum number of operations required as an integer.Sample Input
103 27

Sample Output
4

Sample Input
3 8

Sample Output
5

Explanation for first sample:
Transformation: 103 -> 104 -> 52 -> 26 -> 27, I have written this Solution Code: #include<iostream>
#include<bits/stdc++.h>

using namespace std;
int convert(int m, int n) 
{ 
    if (m == n) 
        return 0; 
    if (m > n) 
        return m - n; 
  
  
    if (n % 2 == 1) 
  
        return 1 + convert(m, n + 1); 
  
    
    else
    
        return 1 + convert(m, n / 2); 
} 
int main()
{
    int  a,b;
    cin>>a>>b;

    cout<<convert(b,a);
    
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?