当前位置:网站首页>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 )
边栏推荐
- The development of mobile IM based on TCP still needs to keep the heartbeat alive
- Practice | mobile end practice
- 电源管理总线 (PMBus)
- Technical tutorial: how to use easydss to push live streaming to qiniu cloud?
- 揭秘技术 Leader 必备的七大清奇脑回路
- 首席信息官如何利用业务分析构建业务价值?
- 网络安全-记录web漏洞修复
- NetSetMan pro (IP fast switching tool) official Chinese version v5.1.0 | computer IP switching software download
- Neural networks and deep learning Chapter 3: linear model reading questions
- windows下Redis-cluster集群搭建
猜你喜欢
Network security - record web vulnerability fixes
Is there a sudden failure on the line? How to make emergency diagnosis, troubleshooting and recovery
MacBook安装postgreSQL+postgis
level17
托管式服务网络:云原生时代的应用体系架构进化
官宣!第三届云原生编程挑战赛正式启动!
Threejs Internet of things, 3D visualization of farms (I)
SPI read / write flash principle + complete code
指针函数(基础)
2022-2028 global and Chinese equipment as a Service Market Research Report
随机推荐
2022-2028 global and Chinese virtual data storage Market Research Report
Official announcement! The third cloud native programming challenge is officially launched!
[phantom engine UE] package error appears! Solutions to findpin errors
About the project error reporting solution of mpaas Pb access mode adapting to 64 bit CPU architecture
解密函数计算异步任务能力之「任务的状态及生命周期管理」
Construction d'un Cluster redis sous Windows
Machine learning decision tree
【虚幻引擎UE】实现背景模糊下近景旋转操作物体的方法及踩坑记录
3 minutes learn to create Google account and email detailed tutorial!
Sword finger offer 07 Rebuild binary tree
This is an age of uncertainty
How should programmers learn mathematics
Network layer - forwarding (IP, ARP, DCHP, ICMP, network layer addressing, network address translation)
TPG x AIDU|AI领军人才招募计划进行中!
Ctfshow 2022 Spring Festival welcome (detailed commentary)
Sequence diagram of single sign on Certification Center
A應用喚醒B應該快速方法
Learning MVVM notes (1)
Burpsuite grabs app packets
Basic analysis of IIC SPI protocol