Submission #72003787

---

Source Code Expand

#include<bits/stdc++.h>
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define PLI pair<LL, int>
using namespace std;

inline void solve() {
	int n, m, ans = INT_MAX; cin >> n >> m;
	vector<int> a(n + 1), b(m + 1);
	for (int i = 1; i <= n; i++) {
		char c; cin >> c;
		a[i] = c - '0'; a[i] += 10;
	}
	for (int i = 1; i <= m; i++) {
		char c; cin >> c; b[i] = c - '0';
	}
	for (int i = 1; i + m - 1 <= n; i++) {
		int sum = 0;
		for (int j = 1; j <= m; j++) {
			sum += (a[i + j - 1] - b[j]) % 10;
		}
		ans = min(ans, sum);
	} 
	cout << ans << "\n";
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	int t = 1;
	//cin >> t;
	while (t--) solve();
	return 0;
}

Submission Info

Judge Result