Spin-Pop-Squeeze-Clap

input/code.cpp: In function 'int main()':
input/code.cpp:26:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int i = 0; i < a.size()+1; i++) {
      |                         ~~^~~~~~~~~~~~
input/code.cpp:27:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             for (int j = 0; j < b.size()+1; j++) {
      |                             ~~^~~~~~~~~~~~

#include <bits/stdc++.h>

using namespace std;
#define ll long long

int main() {

    string astr, bstr;
    cin >> astr >> bstr;

    vector<int> a;
    for (auto &c : astr) a.push_back(c - '0');

    vector<int> b;
    for (auto &c : bstr) b.push_back(c - '0');
    

    ll inf = 1'000'000'000'000;
    

    
    ll min_found = inf;
    for (int k = 0; k < 10; k++) {
        
        vector<vector<ll>> dp(a.size()+1, vector<ll>(b.size()+1, inf));
        for (int i = 0; i < a.size()+1; i++) {
            for (int j = 0; j < b.size()+1; j++) {
                
                if (i == 0) {
                    dp[i][j] = j;
                    continue;
                }

                if (j == 0) {
                    dp[i][j] = i;
                    continue;
                }

                ll &d = dp[i][j];
                // cout << astr << " " << bstr <<  " "  << k << endl;
                // cout << i << " " << j << " " << a[i] << " " << b[j] << endl;
                
                // if ((a[i] + k) % 10 == b[j]) cout << "HEEEY" << " " << k << endl;

                d = min(d, dp[i-1][j-1] + ((a[i-1]+k)%10 == b[j-1] ? 0 : 1));
                d = min(d, dp[i-1][j] + 1);
                d = min(d, dp[i][j-1] + 1);
    
            }
        }

        // cout << "---------------------" << endl; 
        // for (int i = 0; i < a.size(); i++) {
        //     for (int j = 0; j < b.size(); j++) {
        //         cout << dp[i][j] << " ";
        //     }
        //     cout << endl;
        // }

        min_found = min(min_found, dp[a.size()][b.size()] + k);

    }

    cout << min_found << endl;


}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED