main

原创 2015年07月09日 22:28:48

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 squaret. As the king is not in habit of wasting his time, he wants to get from his current positions 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 (froma to h), the second one is a digit from1 to 8.
Output
In the first line print n — minimum number of the king’s moves. Then inn 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;
}

相关文章推荐

MDK main函数运行前的分析

  • 2014年10月24日 08:27
  • 178KB
  • 下载

无法解析的外部符号 _main,该符号在函数 ___tmainCRTStartup 中被引用

无法解析的外部符号 _main,该符号在函数 ___tmainCRTStartup 中被引用   http://blog.sina.com.cn/s/blog_6e6c5f230100p92p.h...

main函数源码

  • 2015年08月06日 16:00
  • 693B
  • 下载

Java中的main()方法详解

Java中的main()方法详解   在Java中,main()方法是Java应用程序的入口方法,也就是说,程序在运行的时候,第一个执行的方法就是main()方法,这个方法和其他的方法有很大的不同...

main_directivity_analysis

  • 2011年03月09日 22:17
  • 72KB
  • 下载

C语言本质-- main函数和启动例程

C语言本质-- main函数和启动例程   2012-06-26 00:12:57|  分类: Linux|字号 订阅 以前我们常用gcc main.c -o ma...

Main 学习test

  • 2012年04月01日 10:03
  • 14KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:main
举报原因:
原因补充:

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