言子檡的优快云博客

【【简答题】】 【题目】 Color Me Less Time Limit: 2 Seconds      Memory Limit: 65536 KB Problem A color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this

【简单题】 【题目】 Palindrom Numbers Time Limit: 2 Seconds      Memory Limit: 65536 KB Statement of the Problem We say that a number is a palindrom if it is the sane when read from left to right

【模拟题】 【题目】 Web Navigation Time Limit: 2 Seconds      Memory Limit: 65536 KB Standard web browsers contain features to move backward and forward among the pages recently visited. One way to i

【【图论题】】 【题目】 Sorting It All Out Time Limit: 2 Seconds      Memory Limit: 65536 KB An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used

【【模拟题】】   【题目】 The Worm Turns Time Limit: 2 Seconds      Memory Limit: 65536 KB Worm is an old computer game. There are many versions, but all involve maneuvering a "worm" around the scree

【【数学题】】 【题目】 I Think I Need a Houseboat Time Limit: 1 Second      Memory Limit: 32768 KB Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the

【【模拟题】】 【题目】 Parencodings Time Limit: 1 Second     Memory Limit:32768 KB Let S = s1 s2 ... s2n be a well-formed string of parentheses. S can be encoded in two different ways: By an inte

【1】ZOJ Problem Set - 1045   【【简单题】】 【题目】   HangOver Time Limit: 1 Second     Memory Limit:32768 KB How far can you make a stack of cards overhang a table? If you have one card, you can

【【搜索题】】   【题目】   Jugs Time Limit: 1 Second     Memory Limit:32768 KB     Special Judge In the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle

【【搜索题】】   【题目】   Anagrams by Stack Time Limit: 1 Second     Memory Limit:32768 KB How can anagrams result from sequences of stack operations? There are two sequences of stack operators which

【搜索题】 【题目】 Knight Moves Time Limit: 2 Seconds      Memory Limit: 65536 KB A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed