摘要：
Euclid ProblemThe ProblemFrom Euclid it is known that for any positive integersAandBthere exist such integersXandYthatAX+BY=D, whereDis the greatest c... 阅读全文
摘要：
Tempter of the BoneProblem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze ... 阅读全文
摘要：
Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:43674Accepted:13612DescriptionFarmer John has been informed of the location of a f... 阅读全文
摘要：
F(x)Problem DescriptionFor a decimal number x with n digits (AnAn-1An-2... A2A1), we define its weight as F(x) = An* 2n-1+ An-1* 2n-2+ ... + A2* 2 + A... 阅读全文
摘要：
Liang Guo ShaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 527Accepted Submission(s): 367Problem... 阅读全文
摘要：
TreeYou 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 bin... 阅读全文
摘要：
Happy 2006Time Limit:3000MSMemory Limit:65536KTotal Submissions:9170Accepted:3092DescriptionTwo positive integers are said to be relatively prime to e... 阅读全文
摘要：
TOYSTime Limit:2000MSMemory Limit:65536KTotal Submissions:9955Accepted:4754DescriptionCalculate the number of toys that land in each bin of a partitio... 阅读全文
摘要：
Problem E: Compound WordsYou are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is... 阅读全文
摘要：
Problem A : Counting SquaresFrom:HDU, 1264Problem DescriptionYour input is a series of rectangles, one per line. Each rectangle is specified as two po... 阅读全文