搜索
文章平均质量分 82
键盘上的舞者
这个作者很懒,什么都没留下…
展开
-
HDU3459:Rubik 2×2×2(IDA)
Problem DescriptionSonny is probably the only computer science Ph.D. student who cannot solve a Rubik's cube. One day, he came across a neat little 2×2×2 Rubik's cube, and thought, "Finally, here's原创 2014-04-20 00:43:41 · 2069 阅读 · 0 评论 -
HDU4876:ZCC loves cards
Problem DescriptionZCC loves playing cards. He has n magical cards and each has a number on it. He wants to choose k cards and place them around in any order to form a circle. He can choose any se原创 2014-07-25 11:00:21 · 1990 阅读 · 0 评论 -
POJ2331:Water pipe(IDA*)
DescriptionThe Eastowner city is perpetually haunted with water supply shortages, so in order to remedy this problem a new water-pipe has been built. Builders started the pipe from both ends simul原创 2014-07-26 16:22:28 · 1845 阅读 · 0 评论 -
HDU1978:How many ways(记忆化)
Problem Description这是一个简单的生存游戏,你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下:1.机器人一开始在棋盘的起始点并有起始点所标有的能量。2.机器人只能向右或者向下走,并且每走一步消耗一单位能量。3.机器人不能在原地停留。4.当机器人选择了一条可行路径后,当他走到这条路径的终点时,他将只有终点所标记的能量。原创 2014-07-27 16:01:58 · 3749 阅读 · 3 评论 -
HDU1078:FatMouse and Cheese(记忆化)
Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At e原创 2014-07-27 17:05:16 · 4904 阅读 · 1 评论 -
HDU4597:Play Game(记忆化)
Problem DescriptionAlice 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原创 2014-07-28 16:28:43 · 2764 阅读 · 0 评论 -
POJ1088:滑雪(记忆化)
DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 2原创 2014-07-28 11:11:42 · 2200 阅读 · 0 评论 -
POJ3373:Changing Digits(记忆化)
DescriptionGiven two positive integers n and k, you are asked to generate a new integer, say m, by changing some (maybe none) digits of n, such that the following properties holds:m contains n原创 2014-07-28 22:47:23 · 2039 阅读 · 0 评论 -
POJ1579:Function Run Fun(记忆化)
DescriptionWe all love recursion! Don't we? Consider a three-parameter recursive function w(a, b, c): if a 1 if a > 20 or b > 20 or c > 20, then w(a, b, c) returns: w(20, 20, 20)原创 2014-07-28 17:18:22 · 3450 阅读 · 1 评论 -
ZOJ3805:Machine
In a typical assembly line, machines are connected one by one. The first machine's output product will be the second machine's raw material. To simplify the problem, we put all machines into a two-d原创 2014-08-26 14:00:00 · 1452 阅读 · 0 评论 -
HDU3567:Eight II(康拓展开+预处理)
Problem DescriptionEight-puzzle, which is also called "Nine grids", comes from an old game. In this game, you are given a 3 by 3 board and 8 tiles. The tiles are numbered from 1 to 8 and each原创 2014-07-21 16:32:51 · 4811 阅读 · 3 评论 -
CSU1460: Kastenlauf(DFS)
DescriptionInputOutputSample Input220 01000 01000 10002000 100020 01000 02000 10002000 2000Sample OutputhappysadHINT题意:给出n+2点的坐标,看从1点能不原创 2014-05-26 13:26:12 · 1334 阅读 · 0 评论 -
HDU1043:Eigth(康托展开)
Problem Description The 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原创 2014-04-05 22:22:53 · 2916 阅读 · 0 评论 -
GDCPC 2008:I Table tennis
The 49th World Table Tennis Championships was held in Guangzhou from February 24th to March 2nd. It was a chance not to be missed for the table tennis enthusiast. TZD and other table tennis enthusiast原创 2014-04-21 19:20:55 · 1440 阅读 · 0 评论 -
GDCPC 2008:F Fengshui
Fengshui is an ancient subject in Chinese tradition. Someone considers it as science and someone criticizes it as blind faith. Who knows! However, in modern days, everyone should respect culture from原创 2014-04-21 19:18:46 · 1575 阅读 · 0 评论 -
GDCPC 2008:B Reading books
Problem BReading books(Input File: book.in / Standard Output) In the summer vacation, LRJ wants to improve himself in computer science. So he finds out N books of computer science in the schoo原创 2014-04-21 19:09:30 · 1415 阅读 · 0 评论 -
HDU1195:Open the Lock(BFS)
Problem DescriptionNow an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. Each time, you can add or minus 1 to any d原创 2014-03-27 10:43:23 · 2695 阅读 · 0 评论 -
HDU1043:Eight(A*+康托)
Problem 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原创 2014-04-08 15:19:39 · 4692 阅读 · 1 评论 -
HDU1560:DNA sequence(IDA星)
Problem DescriptionThe twenty-first century is a biology-technology developing century. We know that a gene is made of DNA. The nucleotide bases from which DNA is built are A(adenine), C(cytosine),原创 2014-04-09 21:40:34 · 4021 阅读 · 0 评论 -
HDU2234:无题I(IDA星)
Problem Description一天机器人小A在玩一个简单的智力游戏,这个游戏是这样的,在一个4*4的矩阵中分别有4个1,4个2,4个3和4个4分别表示4种不同的东西,每一步小A可以把同一行的4个数往左移或者往右移一步或者把同一列的4个数字往上移或者往下移一步(1,2,3,4往左移后是2,3,4,1),小A现在想知道进过最少的几步移动可以将矩阵的每行上的4个数字都一样或者每列上的4个数字原创 2014-04-09 17:00:00 · 2193 阅读 · 0 评论 -
ZOJ3675:Trim the Nails
Robert is clipping his fingernails. But the nail clipper is old and the edge of the nail clipper is potholed.The nail clipper's edge is N millimeters wide. And we use N characters('.' or '*') to rep原创 2014-05-12 20:49:58 · 1133 阅读 · 0 评论 -
FZU2107:Hua Rong Dao(DFS)
Problem DescriptionCao Cao was hunted down by thousands of enemy soldiers when he escaped from Hua Rong Dao. Assuming Hua Rong Dao is a narrow aisle (one N*4 rectangle), while Cao Cao can be regar原创 2014-12-10 15:54:39 · 1744 阅读 · 0 评论 -
HDU3309:Roll The Cube(BFS)
Problem DescriptionThis is a simple game.The goal of the game is to roll two balls to two holes each.'B' -- ball'H' -- hole'.' -- land'*' -- wallRemember when a ball rolls into a hole, t原创 2014-12-11 20:54:24 · 1548 阅读 · 0 评论 -
CSU1604: SunnyPig(BFS)
DescriptionSunnyPig is a pig who is much cleverer than any other pigs in the pigpen. One sunny morning, SunnyPig wants to go out of the pigpen to date Mrs. Snail, his beloved. However, it’s terrib原创 2015-05-03 19:39:25 · 1261 阅读 · 0 评论 -
Codeforces546C:Soldier and Cards
Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible tha原创 2015-06-18 16:03:58 · 1584 阅读 · 0 评论 -
CSU1657: Ways
Description有一个n*n的正整数矩阵,要你求一条从第一行第一列的格子到第n行第n列的路,使得你走过的格子里面的数乘起来的值末尾的零的个数最小。输出最小个数。Input第一行包含1个数n。接下来n行每行n个数字。Output一个数字表示末尾零最小个数。Sample Input31 2 34 5 67原创 2015-06-22 22:03:09 · 770 阅读 · 0 评论 -
CSU1660: K-Cycle
DescriptionA simple cycle is a closed simple path, with no other repeated vertices or edges other than the starting and ending vertices. The length of a cycle is the number of vertices on it. Gi原创 2015-06-22 21:54:39 · 1419 阅读 · 3 评论 -
Codeforces554E:Love Triangles
There are many anime that are about "love triangles": Alice loves Bob, and Charlie loves Bob as well, but Alice hates Charlie. You are thinking about an anime which has n characters. The characters原创 2015-06-26 21:29:17 · 1928 阅读 · 2 评论 -
hunnu11550:欧拉函数
Problem description 一个数x的欧拉函数Φ(x)定义为所有小于x的正整数中与x互质的数的数目,如小于5且和5互质的数有1、2、3、4,一共4个,故Φ(5)=4。对于任意正整数x,我们定义两种操作: 1、f(x) = x + Φ(x);2、g(x) = x * Φ(x);现在,给定一个数a,问从1开始,需要多少步操作能得到a。(如,当a =原创 2015-06-07 20:23:23 · 1286 阅读 · 0 评论 -
HDU4634:Swipe Bo(BFS+状压)
Problem Description“Swipe Bo” is a puzzle game that requires foresight and skill. The main character of this game is a square blue tofu called Bo. We can swipe up / down / left / right to move B原创 2015-07-14 12:19:30 · 1393 阅读 · 0 评论 -
HNU11374:GREAT+SWERC=PORTO(DFS)
Problem descriptionWe want to have a great SWERC at Porto this year and we approached this challenge in several ways. We even framed it as a word addition problem, similar to the classic SEND+原创 2015-08-10 19:41:48 · 1849 阅读 · 1 评论 -
HNU13377:Book Club(DFS)
Problem descriptionPorto’s book club is buzzing with excitement for the annual book exchange event! Every year, members bring their favorite book and try to find another book they like that is原创 2015-08-10 19:50:42 · 1825 阅读 · 1 评论 -
CSU1600:Twenty-four point(DFS)
DescriptionGiven four numbers, can you get twenty-four through the addition, subtraction, multiplication, and division? Each number can be used only once.InputThe input consists of multi原创 2015-05-03 19:34:14 · 1385 阅读 · 0 评论 -
CSU1574: Amanda Lounges
DescriptionInput Output Sample Input4 41 2 22 3 13 4 14 1 2Sample Output3HINTSourceNCPC 2014题意:有n个点,每个点最多一个加油站,然后m个条原创 2015-04-26 17:32:33 · 1498 阅读 · 0 评论 -
HDU2102:A计划(BFS)
Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚,告招天下勇士来拯救公主。不过公主早已习以为常,她深信智勇的骑士LJ肯定能将她救出。现据密探所报,公主被关在一个两层的迷宫里,迷宫的入口是S(0,0,0),公主原创 2014-12-13 13:32:20 · 3461 阅读 · 0 评论 -
hdu2614:Beat(dfs)
Problem DescriptionZty is a man that always full of enthusiasm. He wants to solve every kind of difficulty ACM problem in the world. And he has a habit that he does not like to solvea problem th原创 2014-12-13 13:36:51 · 2710 阅读 · 0 评论 -
HDU3533:Escape(BFS)
Problem 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 ar原创 2014-12-13 13:59:14 · 4307 阅读 · 0 评论 -
HDU4101:Ali and Baba(BFS)
Problem DescriptionThere is a rectangle area (with N rows and M columns) in front of Ali and Baba, each grid might be one of the following:1. Empty area, represented by an integer 0.2. A Stone原创 2014-12-13 14:10:34 · 1113 阅读 · 0 评论 -
CSU1567:Reverse Rot(DFS)
DescriptionAmerican Carnival Makers Inc. (ACM) has a long history of designing rides and attractions. One of their more popular attractions is a fun house that includes a room of mirrors. Their原创 2015-04-07 15:56:30 · 1179 阅读 · 0 评论 -
CSU1566: The Maze Makers(BFS)
DescriptionThe Maze Makers is a publisher of puzzle books. One of their most popular series is maze books. They have a program that generates rectangular two-dimensional mazes like the one shown原创 2015-04-07 16:31:19 · 1075 阅读 · 0 评论