zoukankan      html  css  js  c++  java
  • 贪心——Shortest path of the king

     Shortest path of the king
    time limit per test
     1 second
    memory limit per test
     64 megabytes
    input
     standard input
    output
     standard output

    The king is left alone on the chessboard. In spite of this loneliness, he doesn't lose heart, because he has business of national importance. For example, he has to pay an official visit to square t. As the king is not in habit of wasting his time, he wants to get from his current position s to square t in the least number of moves. Help him to do this.

    In one move the king can get to the square that has a common side or a common vertex with the square the king is currently in (generally there are 8 different squares he can move to).

    Input

    The first line contains the chessboard coordinates of square s, the second line — of square t.

    Chessboard coordinates consist of two characters, the first one is a lowercase Latin letter (from a to h), the second one is a digit from 1to 8.

    Output

    In the first line print n — minimum number of the king's moves. Then in n lines print the moves themselves. Each move is described with one of the 8: L, R, U, D, LU, LD, RU or RD.

    L, R, U, D stand respectively for moves left, right, up and down (according to the picture), and 2-letter combinations stand for diagonal moves. If the answer is not unique, print any of them.

    Examples
    input
    a8
    h1
    
    output
    7
    RD
    RD
    RD
    RD
    RD
    RD
    RD

     自己代码

     1 #include<stdio.h>
     2 int adf(int x)
     3 {
     4     return x>0?x:-x;
     5 }
     6 int asf(int x,int y)
     7 {
     8     return x>y?x:y;
     9 }
    10 int main()
    11 {
    12     char s[5];
    13     int x1,y1,x2,y2;
    14     int x,y,xp,yp,c;
    15     scanf("%s",s);
    16     x1=s[0]-'a'+1;
    17     y1=s[1]-'0';
    18     scanf("%s",s);
    19     x2=s[0]-'a'+1;
    20     y2=s[1]-'0';
    21     xp=x2-x1;
    22     yp=y2-y1;
    23     x=adf(xp);
    24     y=adf(yp);
    25     c=asf(x,y);
    26     printf("%d
    ",c);
    27     while(c--)
    28     {
    29         if(xp>0)
    30             printf("R"),xp--;
    31         if(xp<0)
    32             printf("L"),xp++;
    33         if(yp>0)
    34             printf("U"),yp--;
    35         if(yp<0)
    36             printf("D"),yp++;
    37         printf("
    ");
    38     }
    39     return 0;
    40 }

    参考代码

     1 #include <iostream>
     2 #include <stdio.h>
     3 using namespace std;
     4 
     5 char s[5];
     6 
     7 int ab(int x)
     8 {
     9     if(x<0)
    10         return -x;
    11     return x;
    12 }
    13 
    14 int main()
    15 {
    16     int c1,r1,c2,r2;
    17     //printf("%c",s[0]);
    18     scanf("%s",s);
    19     c1=s[0]-'a'+1;
    20     r1=s[1]-'0';
    21     scanf("%s",s);
    22     c2=s[0]-'a'+1;
    23     r2=s[1]-'0';
    24     int cc=c1-c2,rr=r1-r2;
    25     int t=ab(rr);
    26     if(ab(cc)>ab(rr))
    27         t=ab(cc);
    28     printf("%d
    ",t);
    29     while(t--)
    30     {
    31         if(cc>0)
    32             printf("L"),cc--;
    33         if(cc<0)
    34             printf("R"),cc++;
    35         if(rr>0)
    36             printf("D"),rr--;
    37         if(rr<0)
    38             printf("U"),rr++;
    39         printf("
    ");
    40     }
    41     return 0;
    42 }
  • 相关阅读:
    今天下午去了佛山梁园——广东四大名园之一
    我眼中的Web2.0
    《花眼》观后感
    Implement SOAP services with the Zend Framework
    js 捕捉右键事件
    Zend Framework 第九节数据库操作学习总结
    PHP :time(),date(),mktime()日期与时间函数库{经常会忘却掉}
    zend_soap 实现 web service 用户验证
    php中DOMDocument简单用法(XML创建、添加、删除、修改)
    jquery 判断浏览器方法
  • 原文地址:https://www.cnblogs.com/2016024291-/p/6945744.html
Copyright © 2011-2022 走看看