Shortest path of the king
来源:互联网 发布:微软office软件 编辑:程序博客网 时间:2024/06/06 02:13
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).
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.
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.
a8h1
7RDRDRDRDRDRDRD
本题的第一个输出的是步数,取决于字母之间的差值以及数值之间的差的最大值,之后在输出方向即可,水题。(大一学生,代码不会有很多不足)
(原题链接)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;}
- Shortest path of the king
- Shortest path of the king
- A - Shortest path of the king
- A. Shortest path of the king
- A. Shortest path of the king
- CF3A. Shortest path of the king
- 3A - Shortest path of the king
- Shortest path of the king(贪心)
- CF 3A Shortest path of the king
- Shortest path of the king(比赛2.A)
- coderforce 3A-Shortest path of the king
- codeforces 3A - Shortest path of the king
- Codeforces 3A Shortest path of the king BFS
- code forces 3A Shortest path of the king
- codeforces 3A Shortest path of the king
- 【pair_简单贪心】#3 A. Shortest path of the king
- Codeforces 3A Shortest Path of the King
- Codeforces Round #3A. Shortest path of the king
- [置顶] 一位ACMer过来人的心得
- maven 安装
- 南阳oj 题目75 日期计算
- 黑马程序员-Java基础---IO流介绍
- 王家林亲授《DT大数据梦工厂》大数据实战视频“Scala深入浅出实战经典
- Shortest path of the king
- innodb 乐观插入因空间不够导致失败,进入悲观插入阶段,这个空间的限制大小
- 分治法在算法设计中的运用
- [置顶] 北大ACM试题分类 - 实时更新我所有的解题报告链接
- 阻止“IIS短文件名泄露”
- STL的容器算法迭代器的设计理念
- 设计模式--工厂模式(工厂方法、抽象工厂)
- 堆排序
- GNU make 总结 (三)