英语题目作业（27）

原题：

Open the Lock

 1000ms  32768K

描述：

Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9.
Each time, you can add or minus 1 to any digit. When add 1 to '9', the digit will change to be '1' and when minus 1 to '1', the digit will change to be '9'. You can also exchange the digit with its neighbor. Each action will take one step.

Now your task is to use minimal steps to open the lock.

Note: The leftmost digit is not the neighbor of the rightmost digit.

输入：

The input file begins with an integer T, indicating the number of test cases.

Each test case begins with a four digit N, indicating the initial state of the password lock. Then followed a line with anotther four dight M, indicating the password which can open the lock. There is one blank line after each test case.

输出：

For each test case, print the minimal steps in one line.

样例输入：

2
1234
2144

1111
9999

样例输出：

2
4

（链接：Open the Lock | JXNUOJ）

翻译：

开锁

现在有一个紧急任务交给你——开密码锁。密码是由4位数组成。每位数字都属于1~9中。

每次你可以对每位数字加上或减去1.当对9加上1时，数字变为1，当对1减去1时，数字变为9.你也可以互换相邻两个数字。每个动作算作一步。

你的任务是使用最少的步数开锁。

注意：最左边的数与最右边的数不相邻。

输入：

先输入一个整数T，代表测试组数。每个测试组先输入4位数N，代表密码锁最初显示的密码。下一行输入4位数M,代表能开锁的密码。并每两组测试数组间有一个空格行相隔。

输出：

对于每组测试数组，输出最小操作数（每个占一行）