<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Invalid_Pointer的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Invalid_Pointer</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Invalid_Pointer]]></copyright><item><title><![CDATA[UVa 572 - Oil Deposits]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8706597</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8706597</guid><author>Invalid_Pointer</author><pubDate>Fri, 22 Mar 2013 15:28:28 +0800</pubDate><description><![CDATA[Oil Deposits




The 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]]></description><category></category></item><item><title><![CDATA[UVa 699 - The Falling Leaves]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8656184</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8656184</guid><author>Invalid_Pointer</author><pubDate>Sun, 10 Mar 2013 15:35:05 +0800</pubDate><description><![CDATA[The Falling Leaves


Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the tre]]></description><category></category></item><item><title><![CDATA[UVa 297 - Quadtrees]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8650794</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8650794</guid><author>Invalid_Pointer</author><pubDate>Fri, 08 Mar 2013 15:07:41 +0800</pubDate><description><![CDATA[Quadtrees




A quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into four quadrants. Each quadrant may again be]]></description><category></category></item><item><title><![CDATA[UVa 548 - Tree]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8630911</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8630911</guid><author>Invalid_Pointer</author><pubDate>Sun, 03 Mar 2013 15:22:05 +0800</pubDate><description><![CDATA[Tree 
You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is th]]></description><category></category></item><item><title><![CDATA[UVa 112 - Tree Summing]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8629857</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8629857</guid><author>Invalid_Pointer</author><pubDate>Sat, 02 Mar 2013 21:32:59 +0800</pubDate><description><![CDATA[Tree Summing







Background


LISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used.  Lists, which are the]]></description><category></category></item><item><title><![CDATA[UVa 540 - Team Queue]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8606311</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8606311</guid><author>Invalid_Pointer</author><pubDate>Sun, 24 Feb 2013 01:12:53 +0800</pubDate><description><![CDATA[Team Queue






Queues and Priority Queues are data structures which are known to most computer scientists. TheTeam Queue, however, is not so well known, though it occurs often in everyday lif]]></description><category></category></item><item><title><![CDATA[UVa 11111 - Generalized Matrioshkas]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8605622</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8605622</guid><author>Invalid_Pointer</author><pubDate>Sat, 23 Feb 2013 17:26:03 +0800</pubDate><description><![CDATA[Problem B - Generalized Matrioshkas







Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be op]]></description><category></category></item><item><title><![CDATA[UVa 442 - Matrix Chain Multiplication]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8604306</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8604306</guid><author>Invalid_Pointer</author><pubDate>Fri, 22 Feb 2013 22:52:22 +0800</pubDate><description><![CDATA[Matrix Chain Multiplication






Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which mult]]></description><category></category></item><item><title><![CDATA[UVa 673 - Parentheses Balance]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8599171</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8599171</guid><author>Invalid_Pointer</author><pubDate>Thu, 21 Feb 2013 16:31:01 +0800</pubDate><description><![CDATA[Parentheses Balance






You are given a string consisting of parentheses () and [].    A string of this type is said to be
correct:
(a)if it is the empty string(b)if A and B are correct, AB]]></description><category></category></item><item><title><![CDATA[UVa 10152 - ShellSort]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8595409</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8595409</guid><author>Invalid_Pointer</author><pubDate>Wed, 20 Feb 2013 17:25:02 +0800</pubDate><description><![CDATA[Problem D: ShellSort 
He made each turtle stand on another one's back
And he piled them all up in a nine-turtle stack.
And then Yertle climbed up. He sat down on the pile.
What a wonderful view! H]]></description><category></category></item><item><title><![CDATA[UVa 133 - The Dole Queue]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8592095</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8592095</guid><author>Invalid_Pointer</author><pubDate>Tue, 19 Feb 2013 17:57:15 +0800</pubDate><description><![CDATA[The Dole Queue






In a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy.  Every day all dole applican]]></description><category></category></item><item><title><![CDATA[UVa 101 - The Blocks Problem]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8589142</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8589142</guid><author>Invalid_Pointer</author><pubDate>Mon, 18 Feb 2013 21:02:10 +0800</pubDate><description><![CDATA[The Blocks Problem






Background

Many areas of Computer Science use simple, abstract domains  for both analytical and empirical studies.  For example, an early AI study of planning and ro]]></description><category></category></item><item><title><![CDATA[UVa 127 - "Accordian" Patience]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8587860</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8587860</guid><author>Invalid_Pointer</author><pubDate>Mon, 18 Feb 2013 14:38:06 +0800</pubDate><description><![CDATA[``Accordian'' Patience




You are to simulate the playing of games of ``Accordian'' patience, the rules  for which are as follows:

Deal cards one by one in a row from left to right, not overl]]></description><category></category></item><item><title><![CDATA[UVa 123 - Searching Quickly]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8578349</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8578349</guid><author>Invalid_Pointer</author><pubDate>Mon, 11 Feb 2013 00:04:10 +0800</pubDate><description><![CDATA[Searching Quickly






Background


Searching and sorting are part of the theory and practice of computer science.  For example, binary search provides a good example of an easy-to-understa]]></description><category></category></item><item><title><![CDATA[UVa 10878 - Decode the tape]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577949</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577949</guid><author>Invalid_Pointer</author><pubDate>Sun, 10 Feb 2013 14:53:00 +0800</pubDate><description><![CDATA[Problem A
Decode the tape
Time Limit: 1 second





"Machines take me by surprise with great frequency."



Alan Turing


Your boss has just unearthed a roll of old computer tapes. The]]></description><category></category></item><item><title><![CDATA[UVa10815 - Andy's First Dictionary]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577948</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577948</guid><author>Invalid_Pointer</author><pubDate>Sun, 10 Feb 2013 14:51:37 +0800</pubDate><description><![CDATA[Problem B: Andy's First Dictionary




Time limit: 3 seconds






Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of wo]]></description><category></category></item><item><title><![CDATA[UVa 10115 - Automatic Editing]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577946</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577946</guid><author>Invalid_Pointer</author><pubDate>Sun, 10 Feb 2013 14:49:30 +0800</pubDate><description><![CDATA[Problem E: Automatic Editing




Source file:
autoedit.{c, cpp,java, pas}


Input file:
autoedit.in


Output file:
autoedit.out




Text-processing tools like awk and sed allow you]]></description><category></category></item><item><title><![CDATA[UVa 10106 - Product]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577782</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577782</guid><author>Invalid_Pointer</author><pubDate>Sat, 09 Feb 2013 23:44:15 +0800</pubDate><description><![CDATA[Product







The Problem


The problem is to multiply two integers X, Y. (0250)
The Input


The input will consist of a set of pairs of lines. Each line in pair contains one multiplye]]></description><category></category></item><item><title><![CDATA[UVa 748 - Exponentiation]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577780</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577780</guid><author>Invalid_Pointer</author><pubDate>Sat, 09 Feb 2013 23:39:59 +0800</pubDate><description><![CDATA[Exponentiation




Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience fo]]></description><category></category></item><item><title><![CDATA[UVa 755 - 487--3279]]></title><link>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577771</link><guid>https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8577771</guid><author>Invalid_Pointer</author><pubDate>Sat, 09 Feb 2013 23:03:23 +0800</pubDate><description><![CDATA[487-3279






Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the Un]]></description><category></category></item></channel></rss>