Spin-Pop-Squeeze-Clap

// ~/.vim/cpp_template.cpp
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

#define REP(i,a,b) for (int i = a; i < b; i++)

using namespace std;

template <typename T>
void pV(const std::vector<T>& vec, const std::string& label = "Vector") {
    std::cout << label << ": [ ";
    for (const auto& elem : vec) {
        std::cout << elem << " ";
    }
    std::cout << "]" << std::endl;
}


using namespace std;


void dfs(int s, vector<bool> *visited, vector<int> (*adj)[]) {
    if ((*visited)[s]) return;
    (*visited)[s] = true;
    // process node s


    for (auto u: (*adj)[s]) {
        dfs(u, visited, adj);
    }
}
/*
vector<int> adj[N];                                                          
vector<bool> visited(N, false);
int u, v;
for(int i = 0; i < M;i++){
    cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
}
*/

int a[1002]; 
int b[1002];
int n, m;
int dp[1002][1002];
 
int diff(char x, char y){
    return !(x == y);
}
 
int run(){
    REP(i, 0, 1002){
        REP(j, 0, 1002){
            dp[i][j] = -1;
        }
    }
 
    for (int i = 0; i <= n; i++){
        for (int j = 0; j <= m; j++){
            if (i == 0 && j == 0){
                dp[i][j] = 0;
                continue;
            }
            if (i == 0){
                dp[i][j] = dp[i][j-1]+1;
                continue;
            }
            if (j == 0){
                dp[i][j] = dp[i-1][j]+1;
                continue;
            }
            dp[i][j] = min(min(dp[i-1][j] + 1, dp[i][j-1] + 1), dp[i-1][j-1] + diff(a[i], b[j]));
        }
        
    }
    return dp[n][m];
}
 

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    // Your code starts here

    // convert s to i
    string A, B;
    cin >> A >> B;
    n = A.size();
    m = B.size();
    REP(i, 0, n){
        a[i+1] = (int)A[i] - 48;
    }
    REP(i, 0, m){
        b[i+1] = (int)B[i] - 48;
    }
    int best = 1e9;
    REP(i, 0, 10){
        int curr = run() + i;
        best = min(curr, best);
        REP(i, 1, n+1){
            a[i]++;
            a[i] %= 10;
        }
    }
    cout << best;
    
    return 0;
}

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