Spin-Pop-Squeeze-Clap

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 1e6;

string a, b;
int S[1001][1001];

int main() {
	cin >> a >> b;
	int ans = 1e9;
	for (int i = 0; i < 10; ++i) {
		for (int j = 0; j <= (int)a.size(); ++j) {
			for (int k = 0; k <= (int)b.size(); ++k) {
				if (j == 0) {
					S[j][k] = k;
				} else if (k == 0) {
					S[j][k] = j;
				} else {
					S[j][k] = min(min(S[j-1][k] + 1, S[j][k-1] + 1), S[j-1][k-1] + (a[j-1] != b[k-1]));
				}
			}
		}
		ans = min(ans, S[a.size()][b.size()] + i);
		for (char& c : b) {
			c = c == '0' ? '9' : c-1;
		}
	}
	cout << ans << '\n';
}

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