Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
![](https://i-blog.csdnimg.cn/blog_migrate/dbee840ac94d4efcb847c75249dc061c.png)
The combination lock is represented by n rotating disks with digits from 0 to 9 written on them. Scrooge McDuck has to turn some disks so that the combination of digits on the disks forms a secret combination. In one move, he can rotate one disk one digit forwards or backwards. In particular, in one move he can go from digit 0 to digit 9 and vice versa. What minimum number of actions does he need for that?
The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of disks on the combination lock.
The second line contains a string of n digits — the original state of the disks.
The third line contains a string of n digits — Scrooge McDuck's combination that opens the lock.
Print a single integer — the minimum number of moves Scrooge McDuck needs to open the lock.
5 82195 64723
13
In the sample he needs 13 moves:
- 1 disk:
- 2 disk:
- 3 disk:
- 4 disk:
- 5 disk:
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,sum,hello1,hello2,x;
char password[1111],num[1111];
while(cin>>n){
sum=0;
for(int i=0;i<n;i++){
cin>>num[i];
}
for(int i=0;i<n;i++){
cin>>password[i];
}
for(int i=0;i<n;i++){
if(num[i]>password[i]){
hello1=num[i]-password[i];
hello2=10+(password[i]-num[i]);
}
else{
hello1=password[i]-num[i];
hello2=10+(num[i]-password[i]);
}
if(hello1>hello2){
x=hello2;
}
else{
x=hello1;
}
sum+=x;
}
cout<<sum<<endl;
}
return 0;
}