上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 41 下一页

ZOJ 2158 Truck History

摘要: L - Truck HistoryTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description:DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its ow... 阅读全文
posted @ 2012-11-12 15:15 江财小子 阅读(209) 评论(0) 推荐(0) 编辑

zoj 1586 QS Network

摘要: QS NetworkTime Limit: 2 Seconds Memory Limit: 65536 KBSunny Cup 2003 - Preliminary RoundApril 20th, 12:00 - 17:00Problem E: QS Network In the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS. QScommunicate with each other via networks. If two QS want to get connecte... 阅读全文
posted @ 2012-11-12 15:14 江财小子 阅读(331) 评论(0) 推荐(0) 编辑

poj 3687 Labeling Balls

摘要: Labeling BallsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8225Accepted: 2234DescriptionWindy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in such a way that:No two balls share the same label.The labeling satisfies several constrains like 阅读全文
posted @ 2012-11-12 14:49 江财小子 阅读(179) 评论(0) 推荐(0) 编辑

poj 1270 Following Orders

摘要: Following OrdersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2732 Accepted: 1041DescriptionOrder is an important concept in mathematics and in computer science. For example, Zorn's Lemma states: ``a partially ordered set in which every chain has an upper bound contains a m... 阅读全文
posted @ 2012-11-12 14:45 江财小子 阅读(183) 评论(0) 推荐(0) 编辑

ZOJ 1083 Frame Stacking

摘要: Frame StackingTime Limit: 2 Seconds Memory Limit: 65536 KBConsider the following 5 picture frames placed on an 9 x 8 array.Now place them on top of one another starting with 1 at the bottom and ending up with 5 on top. If any part of a frame covers another it hides that part of the frame below.... 阅读全文
posted @ 2012-11-12 14:43 江财小子 阅读(504) 评论(0) 推荐(0) 编辑

zoj 2193 Window Pains

摘要: Window PainsTime Limit: 2 Seconds Memory Limit: 65536 KBBoudreaux likes to multitask, especially when it comes to using his computer. Never satisfied with just running one application at a time, he usually runs nine applications, each in its own window. Due to limited screen real estate, he ove... 阅读全文
posted @ 2012-11-12 14:38 江财小子 阅读(531) 评论(0) 推荐(0) 编辑

Holedox Moving (zoj 1361 poj 1324)bfs

摘要: Holedox MovingTime Limit: 10 Seconds Memory Limit: 32768 KBDuring winter, the most hungry and severe time, Holedox sleeps in its lair. When spring comes, Holedox wakes up, moves to the exit of its lair, comes out, and begins its new life.Holedox is a special snake, but its body is not very long. ... 阅读全文
posted @ 2012-11-04 23:50 江财小子 阅读(468) 评论(0) 推荐(0) 编辑

poj 2935 Basic Wall Maze (BFS)

摘要: Basic Wall MazeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2384Accepted: 1061Special JudgeDescriptionIn this problem you have to solve a very simple maze consisting of:a 6 by 6 grid of unit squares3 walls of length between 1 and 6 which are placed either horizontally or vertically to s. 阅读全文
posted @ 2012-11-04 23:40 江财小子 阅读(378) 评论(0) 推荐(0) 编辑

Knight Moves (zoj 1091 poj2243)BFS

摘要: Knight MovesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8898Accepted: 5112DescriptionA 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 squares on a chessboard 阅读全文
posted @ 2012-11-04 23:37 江财小子 阅读(351) 评论(0) 推荐(0) 编辑

ZOJ 1136 Multiple BFS(POJ 1465)

摘要: MultipleTime Limit: 10 Seconds Memory Limit: 32768 KBa 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... 阅读全文
posted @ 2012-11-04 23:34 江财小子 阅读(941) 评论(0) 推荐(0) 编辑
上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 41 下一页