Submission #17449864

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

// THINGS TO REMEMBER
// ENDL is slow, '\n' is fast
// Clear everything (including graphs) between test cases
// use anti-anti-hash: https://codeforces.com/blog/entry/62393
// pb-ds: https://codeforces.com/blog/entry/11080
// check when to use LLONG_MAX/LLONG_MIN vs INT_MAX or INT_MIN
// You frequently suffer from confirmation bias - you trust your initial solution and miss simple things. 
// When you hit a roadblock, remember to rethink the solution ground up, not just try hacky fixes

int main(){
	
	#ifndef ONLINE_JUDGE
    	freopen("input", "r", stdin);
    	freopen("output", "w", stdout);
    	freopen("error", "w", stderr);
	#endif
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll x,y,a,b;
    cin>>x>>y>>a>>b;

    ll ans=0;
    while(x<y){
    	// cerr<<x<<" "<<y<<" "<<a<<" "<<b<<endl;
    	if(LLONG_MAX/x >= a &&  x*a-x <= b){
    		x*=a;
    		ans++;
    	}
    	else{
    		ans+=(y-x)/b;
    		if((y-x)%b!=0)ans++;
    		break;
    	}
    }

    cout<<ans-1<<endl;

}

Submission Info

Judge Result