CodeForces 3A（水）

最新推荐文章于 2022-01-23 11:39:27 发布

kunsir_

最新推荐文章于 2022-01-23 11:39:27 发布

阅读量240

点赞数 1

分类专栏：题解

本文链接：https://blog.csdn.net/qq_37804582/article/details/83868471

版权

题解专栏收录该内容

79 篇文章 0 订阅

订阅专栏

CodeForces 3A

A. 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 1 to 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

Copy

a8
h1

output

Copy

7
RD
RD
RD
RD
RD
RD
RD

AC代码：

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
    #ifdef ONLINE_JUDGE
    #else
        freopen("in.txt","r", stdin);
    #endif // ONLINE_JUDGE
    char s1[3], s2[3];
    while(~scanf("%s%s", s1, s2)){
        int a = s2[0] - s1[0];
        int b = s2[1] - s1[1];
        int ans = max(abs(a),abs(b));
        printf("%d\n", ans);
        int minn = min(abs(a),abs(b));
        for(int i = 1; i <= minn; i++){
            if(a < 0 && b < 0) printf("LD\n");
            if(a < 0 && b > 0) printf("LU\n");
            if(a > 0 && b < 0) printf("RD\n");
            if(a > 0 && b > 0) printf("RU\n");
        }
        int a1 = abs(a) - minn;
        int b1 = abs(b) - minn;
        while(a1){
            if(a > 0) printf("R\n");
            else printf("L\n");
            a1--;
        }
        while(b1){
            if(b > 0) printf("U\n");
            else printf("D\n");
            b1--;
        }
    }
    return 0;
}