Shortest path of the king

原创 2015年07月09日 22:12:37
                                                                                                                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.

Sample test(s)
Input
a8
h1
Output
7
RD
RD
RD
RD
RD
RD
RD
  本题的第一个输出的是步数,取决于字母之间的差值以及数值之间的差的最大值,之后在输出方向即可,水题。(大一学生,代码不会有很多不足)
  (原题链接)http://codeforces.com/problemset/problem/3/A         
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int main()
{   char a,b;
    int num1,num2;
    while(scanf("%c%d",&b,&num2)!=-1){
      getchar();
      scanf("%c%d",&a,&num1);
      getchar();
       int min1=0,min2=0,min3=0,min4=0;
       min3=min1=(a-b);
       int max=0;
        if(min1<0) {min3=-1*min1;}  //由于输出须取正值,所以要判断差值的正负
       min4=min2=(num1-num2);
       if(min2<0) {min4=-1*min2;}   //同上
      if(min3>=min4) max=min3;
       else max=min4;
       cout<<max<<endl;
       for(int i=0;i<max;i++){
             if(min1>0) {if(min2==0) {cout<<"R"<<endl;  min1--;} else {cout<<"R";  min1--;}}
             if(min1<0) {if(min2==0) {cout<<"L"<<endl;  min1++;} else {cout<<"L";  min1++;}}
             if(min2>0) {cout<<"U"<<endl;  min2--;}
             if(min2<0) {cout<<"D"<<endl;  min2++;}
       }
    }
    return 0;
}


Leetcode全字符问题

目录 1、编号3 Longest Substring Without Repeating Characters 2、编号6 ZigZag Conversion 3、编号20 Valid Parent...
  • wangxiaojun911
  • wangxiaojun911
  • 2014年02月07日 08:09
  • 2818

最短路径算法(Shortest-path Algorithms)

0) 引论 正如名字所言,最短路径算法就是为了找到一个图中,某一个点到其他点的最短路径或者是距离。 最短路径算法一般分为四种情况: a) 无权重的最短路径 b) 有权重的最短路径 c) 边的权重为负的...
  • changyuanchn
  • changyuanchn
  • 2013年12月03日 11:43
  • 7749

KSP算法的实现(Top-k-shortest paths 的Matlab实现)

摘要 本文主要讲述前K条最短路径的Matlab的实现。 1. all_paths_gen.m函数 function [] = all_paths_gen(weight_matrix, k, ou...
  • Canhui_WANG
  • Canhui_WANG
  • 2016年05月26日 15:43
  • 3495

codeforces 3A - Shortest path of the king

搜索,最短路都可以 #include #include #include #define inf 0x3fffffff using namespace std; in...
  • aixiaoling1314
  • aixiaoling1314
  • 2013年06月22日 15:29
  • 831

【codeforces#3A】Shortest path of the king

【codeforces#3A】Shortest path of the king
  • nininicrystal
  • nininicrystal
  • 2015年08月26日 10:50
  • 193

【pair_简单贪心】#3 A. Shortest path of the king

A. Shortest path of the king time limit per test 1 second memory limit per test 64 megab...
  • okcd00
  • okcd00
  • 2014年03月31日 21:15
  • 538

Codeforces 3A-Shortest path of the king(BFS打印路径)

A. Shortest path of the king time limit per test 1 second memory limit per test 64 megab...
  • qq_16255321
  • qq_16255321
  • 2014年10月07日 12:43
  • 1288

Codeforces 3A Shortest path of the king

EnglishDescThe king is left alone on the chessboard. In spite of this loneliness, he doesn’t lose he...
  • linglian0522
  • linglian0522
  • 2017年05月05日 20:49
  • 310

Codefoeces 3A. Shortest path of the king

A. Shortest path of the king time limit per test 1 second memory limit per test 64 megab...
  • u010365221
  • u010365221
  • 2014年12月07日 13:50
  • 394

codeforces-3A-Shortest path of the king( 棋盘最短路径 + 贪心 )

A. Shortest path of the king time limit per test 1 second memory limit per test 64 megab...
  • qq_16542775
  • qq_16542775
  • 2016年06月03日 15:48
  • 491
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Shortest path of the king
举报原因:
原因补充:

(最多只允许输入30个字)