YunYan

摘要： In this problem, you are given an integer number s. You can transform any integer number A to another integer number B by adding x to A. This x is an 阅读全文

摘要： 农夫知道一头牛的位置，想要抓住它。农夫和牛都于数轴上 ，农夫起始位于点 N(0<=N<=100000) ，牛位于点 K(0<=K<=100000) 。农夫有两种移动方式： 1、从 X移动到 X-1或X+1 ，每次移动花费一分钟 2、从 X移动到 2*X ，每次移动花费一分钟 假设牛没有意识到农夫的行 阅读全文

摘要： Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now. What we are discussing is 阅读全文

摘要： There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he c 阅读全文

摘要： 思路 ： 优先队列 每次都取最小的时间，遇到了终点直接就输出#include #include #include using namespace std; const int N=200; int n,m,sa,ea,sr,er; char arr[N][N]; int bb[N][N]={0}; struct stu{ int a,b; int time; ... 阅读全文