CSES 1744 / DP

/***
 created: 2022-09-26-23.03.03
***/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename U> using ordered_set=tree<U, null_type,less<U>,rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define test int tt; cin>>tt; for(int cs=1;cs<=tt;cs++)
#define get_lost_idiot return 0
#define nl '\n'

ll dp[505][505];

ll solve(ll n,ll m)
{
    if(n==m) return 0;
    if(n>m) swap(n,m);
    if(dp[n][m]!=-1) return dp[n][m];

    ll ans=1e17;

    for(ll i=1;i<n;i++)
    {
        ans=min(ans,solve(n-i,m) + solve(i,m) + 1);
    }
    for(ll i=1;i<m;i++)
    {
        ans=min(ans,solve(n,m-i) + solve(n,i) + 1);
    }

    return dp[n][m]=ans;

}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);


    ll n,m,i,j,k,l;


    cin>>n>>m;

    memset(dp,-1,sizeof dp);

    cout<<solve(n,m)<<nl;


    get_lost_idiot;
}