模拟- Combination Lock 开锁游戏

Combination Lock

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.

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?
Input

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.
Output

Print a single integer — the minimum number of moves Scrooge McDuck needs to open the lock.
Example
Input

5
82195
64723

Output

13

Note

In the sample he needs 13 moves:

1 disk:
2 disk:
3 disk:
4 disk:
5 disk:

#include<bits/stdc++.h>
using namespace std;
const int maxn=1010;
char origin[maxn]={0};
char lockn[maxn]={0};
int step(int a,int b)
{
int temp=max(a,b)-min(a,b);
int temp2=9-max(a,b)+min(a,b)+1;
int s=temp<temp2?temp:temp2;
return s;
}

int main()
{ int n;
  while(~scanf("%d",&n))
  { int ans=0;
      scanf("%s",origin);
      scanf("%s",lockn);
    for(int i=0;i<n;i++)
        ans+=step(origin[i],lockn[i]);
    cout<<ans<<endl;

  }

}