Lngxling的博客

Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 97906 Accepted: 30748DescriptionFarmer John has been informed of the location of a fugit

迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24702 Accepted: 14422Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,

Joe works in a maze. Unfortunately, portions of the maze havecaught on fire, and the owner of the maze neglected to create a fireescape plan. Help Joe escape the maze.Given Joe’s location in the

Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23030 Accepted: 12756DescriptionThe ministers of the cabinet were quite upset by the message

Problem 2150 Fire GameAccept: 2713    Submit: 9264Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem DescriptionFat brother and Maze are playing a kind of special (hentai) game o

C. The Tag Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice got tired of playing the tag game by t

D. Biridian Foresttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou're a mikemon breeder currently in th

题意：从Y走到T的最短路径，走E和T需要一秒，B需要两秒，R和S不能走思路：bfs一下，记录到每个点的最短路径长度#include <iostream>#include <queue>#include <cstring>#include <cstdio>using namespace std;#define mod 100...

思路：有三个容器，每个最大是100，共有100*100*100=1e6种状态，深搜记录一下每种状态和这种状态的最小步数深搜时遍历每个容器，如果这个容器里有可乐，就尝试着倒入另外两个容器里#include <iostream>#include <cstdio>#include <cmath>#include <vector>#in...