Shortest path of the king
2015-07-21 20:41
288 查看
http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19980
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit Status Practice CodeForces 3A
Description
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 Input
Input
Output
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit Status Practice CodeForces 3A
Description
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 Input
Input
a8 h1
Output
7 RD RD RD RD RD RD RD 越简单越简单~
#include<iostream> #include<cstdio> #include<cmath> using namespace std; int main() { char str1[3], str2[3]; while(cin >> str1 >> str2) { int x1, x2, y1, y2; x1 = str1[0] - 'a'; y1 = str1[1] - '0'; x2 = str2[0] - 'a'; y2 = str2[1] - '0'; int tmp = max(abs(x1-x2), abs(y1-y2)); cout << tmp << endl; while(x1!=x2 || y1 != y2) { if(x1 > x2) { cout << "L"; x1--; } if(x1 < x2) { cout << "R"; x1++; } if(y1 < y2) { cout << "U"; y1++; } if(y1 > y2) { cout << "D"; y1--; } cout << endl; } } return 0; }
相关文章推荐
- http协议:http请求、http响应、间隔时间跳转页面、禁用浏览器缓存
- To and Fro
- OC05 -- 数组
- 快速傅里叶变换(FFT)的C#实现及详细注释
- Record-2-4
- 今年暑假不AC
- 关于java基础--排序方法
- [CareerCup] 2.6 Linked List Cycle 单链表中的环
- PHPCMS \phpcms\modules\member\index.php 用户登陆SQL注入漏洞分析
- 逻辑回归模型分析
- 什么是线程,线程与进程有什么区别?
- CoreDataDemo
- swift2 自动引用计数
- 大图轮播
- Node.js的线程和进程
- [DLX重复覆盖] hdu 3957 Street Fighter
- POJ 1185 炮兵阵地(状态压缩dp)
- SQL server 2008数据库的备份与还原
- Spring Quartz集群(二)
- 为什么你只是个码农