题目传送门
1 /* 2 贪心水题：累加到目标数字的距离，两头找取最小值 3 */ 4 #include <cstdio> 5 #include <iostream> 6 #include <algorithm> 7 #include <cstring> 8 using namespace std; 9 10 const int MAXN = 1e3 + 10; 11 const int INF = 0x3f3f3f3f; 12 char s[MAXN], t[MAXN]; 13 14 int main(void) //Codeforces Round #301 (Div. 2) A. Combination Lock 15 { 16 //freopen ("A.in", "r", stdin); 17 18 int n; 19 while (scanf ("%d", &n) == 1) 20 { 21 scanf ("%s", &s); 22 getchar (); 23 scanf ("%s", &t); 24 25 int ans = 0; 26 for (int i=0; i<n; ++i) 27 { 28 int tmp = abs (t[i]-s[i]); 29 ans += min (tmp, 10 - tmp); 30 } 31 32 printf ("%d\n", ans); 33 } 34 35 return 0; 36 }
