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
4
入门级bfs，分析各种可能情况，广度搜索密码，以初始密码为基，密码的每位可以加一，减一，与邻位互换，三种情况，共产生十一种可能密码数，
每种密码数又经过相同操作，同可以产生十一种可能。利用队列先进先出的特性，进行广度搜索。需注意标记已产生的数，避免重复操作。
