2016年08月_is_wyQ

原创【POJ 1860】Currency Exchange（Bellman_Ford）

DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies.

2016-08-18 15:09:19 493

原创【POJ 2253】Frogger（Dijkstra）

DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tou

2016-08-15 17:01:49 389

原创【HDU 2102】A计划（BFS）

Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智勇的骑士LJ肯定能将她救出。现据密探所报，公主被关在一个两层的迷宫里，迷宫的入口是S（0，0，0），公主的位置用P表示，时空传输

2016-08-15 15:17:12 444

原创【FJNU】周赛#2题解

A.58秒95！！【LightOJ 1028 Trailing Zeroes 】题目大意给出一个n。问存在多少个m进制( m < n )使得在m进制下末尾为0。就是求n的因子个数。思路打表10^6以内的素数，然后枚举素数代码#include<iostream>#include<cstdio>#include<string.h>#include<algorithm>#include<queu

2016-08-12 19:32:58 654

原创【HDU 3533】Escape（BFS）

DescriptionThe students of the HEU are maneuvering for their military training. The red army and the blue army are at war today. The blue army finds that Little A is the spy of the red army, so Littl

2016-08-10 16:09:41 409

原创【HDU 2181】哈密顿绕行世界问题（DFS）

Description一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m<=20,m>=1.m=0退出. Output输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路线,按字典序输出,每行1条路线.每行首先输出是第

2016-08-10 15:48:29 372

原创【HDU 1043】Eight（A*启发式搜索算法）

DescriptionThe 15-puzzle has been around for over 100 years; even if you don’t know it by that name, you’ve seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and

2016-08-04 15:52:59 1551 1

原创【HDU 2612】Find a way（BFS）

DescriptionPass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifenfei’s home i

2016-08-03 10:35:35 534

原创【POJ 3984】迷宫问题（BFS）

Description定义一个二维数组： int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。Input一个5 × 5的二维数组，表示一个迷宫。数

2016-08-02 20:19:52 1292

原创【UVA 11624】Fire!（BFS）

DescriptionJoe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s locat

2016-08-02 20:14:22 309

原创【FZU 2150】Fire Game（BFS）

DescriptionFat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then

2016-08-02 20:02:03 647

原创【POJ 3414】Pots（BFS）

DescriptionYou are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap; DROP(i) empt

2016-08-02 19:51:42 675

原创【POJ 2251】Dungeon Master（BFS）

DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit no

2016-08-02 19:39:29 391

原创【POJ 1321】棋盘问题（DFS）

Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 , k <=

2016-08-02 11:01:02 1115

原创【POJ 3087】Shuffle'm Up（BFS,模拟,）

DescriptionA common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C

2016-08-01 10:30:37 443

Ice_Confuse