Shared code

/*
  author: @ankingcodes
  created: 2021-08-08 11:14:53.582524
*/
        
#include<bits/stdc++.h>
#include<algorithm>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define INF 1e18
#define f first
#define s second
#define mp make_pair
#define pb push_back
const int MOD = (int) 1e9 + 7;

typedef tree<int, null_type, less<int>, rb_tree_tag,
                tree_order_statistics_node_update> PBDS;

typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
                tree_order_statistics_node_update> pairPBDS;


int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int w, h; cin >> w >> h;
  int dp[w+1][h+1];
  for (int i=0;i<=w;i++){
    for (int j=0;j<=h;j++){
      if (i == j) dp[i][j] = 0;
      else {
        dp[i][j] = MOD;
        for (int k=1;k<i;k++) 
          dp[i][j] = min(dp[i][j], dp[k][j]+dp[i-k][j]+1);
        for (int k=1;k<j;k++)
          dp[i][j] = min(dp[i][j], dp[i][k]+dp[i][j-k]+1);
      }
    }
  }
  cout << dp[w][h] << endl;
  return 0;
}