CUC-SUMMER-CONTEST-1-A

A - Shortest path of the king

CodeForces - 3A

---

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.

Example
Input
a8
h1

Output
7
RD
RD
RD
RD
RD
RD
RD

---

题意：给定起始和终点坐标，问从起始最少经过几次移动能到达终点，移动方式有八种，上下左右，左上左下，右上右下。

解法：先斜向移动，使当前横坐标或纵坐标等于终点坐标时再水平或垂直移动。

代码：

#include<iostream>
#include<cmath>
#include<math.h>
using namespace std;
int main()
{
    char x1,y1,x2,y2;
    cin>>x1>>y1>>x2>>y2;
    cout<<max(abs(x1-x2),abs(y1-y2))<<endl;
    while(1){
        if(x1==x2&&y1==y2)
            break;
        if(x2>x1){
            x1++;
            cout<<"R";
        }
        else if(x2<x1){
            x1--;
            cout<<"L";
        }
        if(y2>y1){
            y1++;
            cout<<"U";
        }
        else if(y1>y2){
            y1--;
            cout<<"D";
        }
        cout<<endl;
    }
}