搜索
文章平均质量分 77
whppmy
博客搬到 bugnull.com
展开
-
农夫过河
描述农夫每天去种地都要过一条河,这条河很宽,过河要走上面的木桩。木桩有n支,排成一排,从左岸延伸到右岸,编号从1到n。左岸在1号桩的左边,右岸在n号桩的右边。但这些木桩会定时升降,因此每天他都花不少时间在过河上。所以他想找一种最快过河的方法。在时刻0,农夫在左岸,他要在最短时间内到达右岸。在任何时刻,每一支桩都只能处于升或降的其中一种状态。升起的桩可以站上去,农夫只能站在升起的桩上原创 2015-05-26 19:17:08 · 1146 阅读 · 0 评论 -
HDU 1016 Prime Ring Problem
A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note: the number o原创 2015-07-14 10:04:18 · 300 阅读 · 0 评论 -
HDU 1241 Oil Deposits
Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a原创 2015-07-14 10:01:41 · 313 阅读 · 0 评论 -
HDU 1253 胜利大逃亡
Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个坐标中的其中一个.现在给你城堡的地图,请你计算原创 2015-07-14 09:47:42 · 392 阅读 · 0 评论 -
CSU 1511 残缺的棋盘
Input输入包含不超过10000 组数据。每组数据包含6个整数r1, c1, r2, c2, r3, c3 (1Output对于每组数据,输出测试点编号和最少步数。Sample Input1 1 8 7 5 61 1 3 3 2 2Sample OutputCase 1: 7C原创 2015-08-10 19:46:04 · 727 阅读 · 0 评论 -
ZOJ 2850 Beautiful Meadow
Tom's Meadow Tom has a meadow in his garden. He divides it into N * M squares. Initially all the squares were covered with grass. He mowed down the grass on some of the squares and thinks the mead原创 2015-08-05 15:28:00 · 601 阅读 · 0 评论 -
HDU 4528 小明系列故事――捉迷藏
小明的妈妈生了三个孩子,老大叫大明, 老二叫二明, 老三..., 老三自然就叫小明了。 一天,小明的妈妈带小明兄弟三人去公园玩耍,公园里面树木很多,有很多地方可以藏身, 于是他们决定玩捉迷藏。经过几轮的猜拳后,第一轮是小明来找其他两个人,游戏规则很简单: 只要小明可以在规定的时间内找到他们就算小明获胜,并且被发现的两个人猜拳决定谁在下一轮负责找人;如果在规定的时间内只找到一个人,那转载 2015-08-05 15:05:06 · 610 阅读 · 0 评论 -
ZOJ 1002 FZU 1098 HDU 1045 Fire Net
Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small castl转载 2015-07-15 17:00:42 · 416 阅读 · 0 评论 -
ZOJ 2975 Kinds of Fuwas
In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China as well as becoming a festival for people all over the world.The official mascots of Bei原创 2015-09-06 15:35:05 · 540 阅读 · 0 评论 -
HDU 1180 诡异的楼梯
Problem DescriptionHogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的,相反,他们每隔一分钟就变动一次方向.比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路线,这时Ron(Harry最好的朋友)告诉Harry正好有一个魔法原创 2015-07-14 16:41:37 · 986 阅读 · 0 评论 -
ZOJ 3699 Dakar Rally
The Dakar Rally is an annual Dakar Series rally raid type of off-road race, organized by the Amaury Sport Organization. The off-road endurance race consists of a series of routes. In different routes,转载 2015-08-19 17:09:05 · 677 阅读 · 0 评论 -
CSU 1513 Kick the ball!
"A penalty shoot-out (officially kicks from the penalty mark) is a method of determining the winner of an association football (soccer) match that is drawn after the regulation playing time and any ap原创 2015-08-10 19:47:34 · 717 阅读 · 0 评论 -
LightOJ 1051 Good or Bad
A string is called bad if it has 3 vowels in a row, or 5 consonants in a row, or both. A string is called good if it is not bad. You are given a string s, consisting of uppercase letters('A'-'Z') an原创 2015-08-06 17:01:09 · 465 阅读 · 0 评论 -
HDU 1548 A strange lift
Total Submission(s) : 11 Accepted Submission(s) : 3Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every fl转载 2015-07-14 09:54:52 · 345 阅读 · 0 评论 -
HDU 1015 Safecracker
=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and h原创 2015-07-14 09:46:14 · 420 阅读 · 0 评论 -
HDU 1072 Nightmare
Problem DescriptionIgnatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb e原创 2015-07-14 13:54:56 · 298 阅读 · 0 评论 -
HDU 1372 Knight Moves
Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n原创 2015-07-14 14:36:36 · 421 阅读 · 0 评论 -
马的走法
在一个4X5的棋盘上,马的起始位置坐标(纵、横)位置由键盘输入,求马能返回初始位置的所有不同走法的总数(马走过的位置不能重复,马走“日”字)。输入输入文件第一行为测试用例的个数N,接下来N行,每行两个正整数x,y(1,表示马的位置坐标.输出每个测试用例的输出占一行,输出马能返回初始位置的所有不同走法的总数,如果没有,则输出“ERROR”(不包含双引号)。原创 2015-07-16 16:26:16 · 1051 阅读 · 0 评论 -
ZOJ 3890 Wumpus
One day Leon finds a very classic game called Wumpus.The game is as follow.Once an agent fell into a cave. The legend said that in this cave lived a kind of monster called Wumpus, and there were hor原创 2015-09-05 17:21:29 · 467 阅读 · 0 评论 -
ZOJ 2412 Farm Irrigation
Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a different type of原创 2015-09-05 16:46:29 · 521 阅读 · 0 评论 -
ZOJ 3861 Valid Pattern Lock
Pattern lock security is generally used in Android handsets instead of a password. The pattern lock can be set by joining points on a 3 × 3 matrix in a chosen order. The points of the matrix are regis原创 2015-09-05 18:21:00 · 403 阅读 · 0 评论 -
HDU 1728 逃离迷宫
给定一个m × n (m行, n列)的迷宫,迷宫中有两个位置,gloria想从迷宫的一个位置走到另外一个位置,当然迷宫中有些地方是空地,gloria可以穿越,有些地方是障碍,她必须绕行,从迷宫的一个位置,只能走到与它相邻的4个位置中,当然在行走过程中,gloria不能走到迷宫外面去。令人头痛的是,gloria是个没什么方向感的人,因此,她在行走过程中,不能转太多弯了,否则她会晕倒的。我们假定给定的原创 2015-07-14 09:53:29 · 432 阅读 · 0 评论 -
HDU 4707 Pet
One day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use some cheese to trap the hamster. He put the cheese tr原创 2015-08-19 15:05:39 · 485 阅读 · 0 评论 -
HDU 2102 A计划
Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚,告招天下勇士来拯救公主。不过公主早已习以为常,她深信智勇的骑士LJ肯定能将她救出。现据密探所报,公主被关在一个两层的迷宫里,迷宫的入口是S(0,0,0),公主的位转载 2015-07-14 09:58:55 · 425 阅读 · 0 评论 -
CSU 1034 The Composition of Letters
Given a list of n letters (A1, A2, A3… An) and a word W. The letters and the word are in capitals. Each letter has a value which is its sequence in the alphabet. For example, ‘A’ has a value that equa原创 2015-08-05 15:39:00 · 461 阅读 · 0 评论 -
HDU 1181 变形课
Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体.Harry已经将他所会的所有咒语都列成了一个表,他想让你帮忙计算一下他是否能完成老师的作业,将一个B(b原创 2015-07-14 10:00:25 · 356 阅读 · 0 评论 -
HDU 1010 Tempter of the Bone
The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone转载 2015-07-14 09:44:44 · 384 阅读 · 0 评论 -
HDU 4597 Play Game
Alice and Bob are playing a game. There are two piles of cards. There are N cards in each pile, and each card has a score. They take turns to pick up the top or bottom card from either pile, and the s原创 2015-08-05 14:43:46 · 436 阅读 · 0 评论 -
HDU 1240 Asteroids!
Problem DescriptionYou're in space.You want to get home.There are asteroids.You don't want to hit them. InputInput to this problem will consist of a (non-empty) series of up to 100 d原创 2015-07-14 14:39:37 · 463 阅读 · 0 评论 -
HDU 1312 Red and Black
Problem DescriptionThere 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 can move to one of four adjace原创 2015-07-14 10:03:16 · 368 阅读 · 0 评论 -
HDU 1242 Rescue
Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: approach Angel. W原创 2015-07-14 15:41:47 · 393 阅读 · 0 评论 -
2016长城信息杯中国大学生程序设计竞赛中南邀请赛 xtu 1245 Hamiltonian Path
http://www.dengwenhuo.cn/?id=197In ICPCCamp, there arencities andmdirected roads between cities. Thei-th road going from theai-th city to thebi-th city iscikilometers long. For each原创 2016-06-20 13:40:01 · 1221 阅读 · 0 评论