Submission #2850877

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
using ll = long long;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=int(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
const ll mod = 1000000007;
int N, S, T;
int ans;
using namespace std;
void dfs(int a, int cnt){
    if(a>T) return ;
    if(a==T){
        ans = cnt;
        return;
    }
    dfs(a*2, cnt+1);
    dfs(a*2+1, cnt+1);
    return;
}
int main() {
     cin >> N >> S >> T;
    if(S>T) {
        cout << -1 << endl;
        return 0;
    }else if(S==T){
        cout << 0 << endl;
    }else{
        dfs(S, 0);
        if(ans==0) cout << -1 << endl;
        else cout << ans << endl;
    }
        
		return 0;
}

Submission Info

Judge Result