zoukankan      html  css  js  c++  java
  • Open the Lock

    Problem Description
    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.
     

    Sample Input
    2 1234 2144 1111 9999
     

    Sample Output
    2 4
     

    Author
    YE, Kai
     

    #include <iostream>
    #include <cstring>
    #include <cstdio>
    #include <cmath>
    using namespace std;
    int f[10],a[10],b[10],mx;
    int fun(int m)
    {
        int sum,c[]={m/1000,m/100%10,m/10%10,m%10};
        for(int i=sum=0;i<4;i++)
        {
            if(abs(c[i]-b[i])<5)sum+=abs(c[i]-b[i]);
            else sum+=9-abs(c[i]-b[i]);
        }
        return sum;
    }
    int dfs(int sum,int temp)
    {
        if(sum>999)
        {
            int i=fun(sum)+temp;
            if(mx>i)mx=i;
            return 0;
        }
        for(int i=0;i<4;i++)
        {
            if(!f[i])
            {
                f[i]=1;
                dfs(sum*10+a[i],temp++);
                f[i]=0;
            }
        }
    }
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
          scanf("%1d%1d%1d%1d",&a[0],&a[1],&a[2],&a[3]);
          scanf("%1d%1d%1d%1d",&b[0],&b[1],&b[2],&b[3]);
        mx=10000;
        dfs(0,0);
        printf("%d
    ",mx);
        }
       return 0;
    }
    


  • 相关阅读:
    zabbix 组信息
    perl tk说明
    perl tk说明
    haproxy ssl相关配置
    haproxy ssl相关配置
    haproxy 关闭ssl 3.0 加密
    haproxy 关闭ssl 3.0 加密
    【华为敏捷/DevOps实践】4. 如何从Excel做项目管理的方式中走出来
    【华为云实战开发】13.如何在云端快速搭建python网站
    【华为云实战开发】12.如何在云端快速开展Swagger接口测试
  • 原文地址:https://www.cnblogs.com/mfrbuaa/p/4175328.html
Copyright © 2011-2022 走看看