50求调QAQ

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
    int n;
    string x, y;
    cin >> n >> x >> y;
    int res = 0; 
    int carry = 0;
    for (int i = n - 1; i >= 0; --i) {
        int a = x[i] - '0' + carry;  
        int b = y[i] - '0';          
        carry = 0;  
        if (a == b) {
            continue;  
        }
        int direct = abs(b - a);
        int wrap = 10 - direct;  
        if (direct < wrap) {
            res += direct;
        } else {
            res += wrap;
            
            if (b > a) {
                carry = -1; 
            }
             else {
                carry = 1;   
            }
        }
    }
    cout << res << endl;
    return 0;
}