当前位置:网站首页>English topic assignment (27)
English topic assignment (27)
2022-07-05 04:31:00 【m0_ sixty-five million seven hundred and eighty-eight thousand 】
The original title is :
Open the Lock
1000ms 32768K
describe :
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.
Input :
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.
Output :
For each test case, print the minimal steps in one line.
The sample input :
2 1234 2144 1111 9999
Sample output :
2 4
( link :Open the Lock | JXNUOJ)
translate :
The lock
Now I have an urgent task for you —— Unlock the code lock . The code is from 4 It's made up of digits . Every number belongs to 1~9 in .
Each time you can add or subtract 1. When the 9 add 1 when , Change to numbers 1, When the 1 subtract 1 when , Change to numbers 9. You can also exchange two adjacent numbers . Each action counts as a step .
Your task is to unlock with the least number of steps .
Be careful : The leftmost number is not adjacent to the rightmost number .
Input :
Enter an integer first T, Represents the number of test groups . Each test group first enters 4 digit N, Represents the password originally displayed by the password lock . Next line input 4 digit M, Represents the password that can unlock . And there is a space line between each two groups of test arrays .
Output :
For each set of test arrays , Output minimum operand ( Each takes up a line )
边栏推荐
- Machine learning decision tree
- Components in protective circuit
- Stage experience
- Fonction (sujette aux erreurs)
- Discussion on the dimension of confrontation subspace
- Hexadecimal to decimal
- 【虛幻引擎UE】實現UE5像素流部署僅需六步操作少走彎路!(4.26和4.27原理類似)
- Sword finger offer 04 Search in two-dimensional array
- MacBook installation postgresql+postgis
- 机器学习 --- 神经网络
猜你喜欢
【虚幻引擎UE】实现背景模糊下近景旋转操作物体的方法及踩坑记录
level17
Sword finger offer 04 Search in two-dimensional array
托管式服务网络:云原生时代的应用体系架构进化
windows下Redis-cluster集群搭建
How should programmers learn mathematics
【科普】热设计基础知识:5G光器件之散热分析
Interview related high-frequency algorithm test site 3
Uncover the seven quirky brain circuits necessary for technology leaders
windows下Redis-cluster集群搭建
随机推荐
mxnet导入报各种libcudart*.so、 libcuda*.so找不到
You Li takes you to talk about C language 7 (define constants and macros)
Rome chain analysis
Machine learning -- neural network
Setting up redis cluster cluster under Windows
【科普】热设计基础知识:5G光器件之散热分析
Sword finger offer 04 Search in two-dimensional array
A application wakes up B should be a fast method
windows下Redis-cluster集群搭建
Label exchange experiment
Introduction to RT thread kernel (5) -- memory management
美国5G Open RAN再遭重大挫败,抗衡中国5G技术的图谋已告失败
Network layer - forwarding (IP, ARP, DCHP, ICMP, network layer addressing, network address translation)
Threejs Internet of things, 3D visualization of farms (II)
C26451: arithmetic overflow: use the operator * on a 4-byte value, and then convert the result to an 8-byte value. To avoid overflow, cast the value to wide type before calling the operator * (io.2)
程序员应该怎么学数学
Mxnet imports various libcudarts * so、 libcuda*. So not found
How to carry out "small step reconstruction"?
Neural networks and deep learning Chapter 6: Circular neural networks reading questions
QT Bluetooth: a class for searching Bluetooth devices -- qbluetooth devicediscoveryagent