随笔分类 -  深搜&广搜

HDU 1520 Anniversary Party
摘要：Problem DescriptionThe president of the Ural State University is going to make an 80'th Anniversary party. The university has a hierarchical structure... 阅读全文
posted @ 2014-03-27 12:09 chen2013 阅读(230) 评论(0) 推荐(0)
ZOJ 1003 Crashing Balloon
摘要：On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV. The rule is very simple. On the ground there are 100 labe... 阅读全文
posted @ 2014-03-23 19:29 chen2013 阅读(194) 评论(0) 推荐(0)
HDU 4171 Paper Route
摘要：Problem DescriptionAs a poor, tuition-ridden student, you've decided to take up a part time job as a paperboy/papergirl.You've just been handed your p... 阅读全文
posted @ 2014-03-22 18:55 chen2013 阅读(362) 评论(0) 推荐(0)
TOJ 4523 Transportation
摘要：DescriptionGiven N stations, you want to carry goods from station 1 to station N. Among these stations, we use M tubes to connect some of them. Each t... 阅读全文
posted @ 2014-03-10 22:55 chen2013 阅读(247) 评论(0) 推荐(0)
TOJ 3176 Challenge from XOR
摘要：DescriptionMr. AngelClover just learnt XOR on his Computer Class. XOR is a bit arithmetic operator that returns one value if one, but not both, of its... 阅读全文
posted @ 2014-02-25 22:51 chen2013 阅读(367) 评论(0) 推荐(0)
TOJ 3248 Flip Game
摘要：Description Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and... 阅读全文
posted @ 2014-02-24 21:19 chen2013 阅读(269) 评论(0) 推荐(0)
TOJ 3031 Multiple
摘要：Descriptiona program that, given a natural number N between 0 and 4999 (inclusively), and M distinct decimal digits X1,X2..XM (at least one), finds the smallest strictly positive multiple of N that has no other digits besides X1,X2..XM (if such a multiple exists). InputThe input has several data set 阅读全文
posted @ 2014-02-24 12:38 chen2013 阅读(266) 评论(0) 推荐(0)
HDU 4460 Friend Chains
摘要：Problem DescriptionFor a group of people, there is an idea that everyone is equals to or less than 6 steps away from any other person in the group, by... 阅读全文
posted @ 2014-02-17 12:58 chen2013 阅读(415) 评论(0) 推荐(0)
TOJ 2939 解救小Q
摘要：描述小Q被邪恶的大魔王困在了迷宫里，love8909决定去解救她。迷宫里面有一些陷阱，一旦走到陷阱里，就会被困身亡:(，迷宫里还有一些古老的传送阵，一旦走到传送阵上，会强制被传送到传送阵的另一头。现在请你帮助love8909算一算，他至少需要走多少步才能解救到小Q？ (上下左右四个方向走，传送门可以多次使用)输入第一行为一个整数T，表示测试数据组数。每组测试数据第一行为两个整数N，M，(1 #include #include #include #define MAXN 55using namespace std;int T,M,N;int csMap[27][5];char m[MAXN][M 阅读全文
posted @ 2014-02-11 14:30 chen2013 阅读(565) 评论(0) 推荐(0)
TOJ 4393 Game
摘要：描述 Bob always plays game with Alice.Today,they are playing a game on a tree.Alice has m1 stones,Bob has m2 stones.At the beginning of the game,all the stones are placed on the nodes of a tree,except the root.Alice moves first and they turns moving the stones.On each turn,the player chooses exactly o 阅读全文
posted @ 2014-02-08 18:05 chen2013 阅读(195) 评论(0) 推荐(0)
TOJ 3184 Mine sweeping
摘要：描述I think most of you are using system named of xp or vista or win7.And these system is consist of a famous game what is mine sweeping.You must have p... 阅读全文
posted @ 2014-02-07 16:49 chen2013 阅读(334) 评论(0) 推荐(0)
POJ 2362 Square
摘要：DescriptionGiven a set of sticks of various lengths, is it possible to join them end-to-end to form a square?InputThe first line of input contains N, ... 阅读全文
posted @ 2014-02-07 15:27 chen2013 阅读(265) 评论(0) 推荐(0)