提出 #72042554

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
int main(){
	int n , m;
	cin >> n >> m;
	string s , t;
	cin >> s >> t;
	int p = t.size();
	int minn = 1e9;
	for(int i = 0 ; i < (int)s.size() - p + 1 ; i++){
			int j = i + p - 1;
			int sum = 0;
			for(int k = i , q = 0 ; k <= j ; k++ , q++){
				//cout << s[k] << " " << t[q] << endl;
				if(s[k] < t[q]) sum += 9 - (t[q] - '0') + (s[k] - '0') + 1;
				else sum += (s[k] - '0') - (t[q] - '0');
			}	
			//cout << endl;
			//cout << sum << endl;
			minn = min(minn , sum);

	}
	cout << minn;
    return 0;
}

提出情報

ジャッジ結果