Rectangle Cutting ( CSES )

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <climits>
#include <queue>
using namespace std;
int a, b, dp[501][501];
void read()
{
   cin >> a >> b;
}
void Minimize(int & a, int b)
{
    a = min(a, b);
}
void solve()
{
   for (int i = 1; i <= a; ++ i)
   {
       for (int j = 1; j <= b; ++ j)
       {
           if ( i == j)
           {
               dp[i][j] = 0;
           }
           else
           {
               dp[i][j] = 1e9;
               for (int k = 1; k < i; ++ k)
               {
                   Minimize(dp[i][j], dp[i-k][j] + dp[k][j] + 1);
               }
               for (int k = 1; k < j; ++ k)
               {
                   Minimize(dp[i][j], dp[i][j - k] + dp[i][k] + 1);
               }
           }
       }
   }
   cout << dp[a][b];
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    read();
    solve();
}
// dp[i][j] số đường cắt nhỏ nhất xét tới ô i j