2014年5月19日
HDU 4734 F(x)
摘要： 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... 阅读全文
posted @ 2014-05-19 23:05 炒饭君 阅读(171) 评论(0) 推荐(0) 编辑
HDU 3910 Liang Guo Sha
摘要： Liang Guo ShaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 527Accepted Submission(s): 367Problem... 阅读全文
posted @ 2014-05-19 21:30 炒饭君 阅读(144) 评论(0) 推荐(0) 编辑
uva 548 Tree
摘要： 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... 阅读全文
posted @ 2014-05-19 20:51 炒饭君 阅读(152) 评论(0) 推荐(0) 编辑
POJ 2773 Happy 2006
摘要： Happy 2006Time Limit:3000MSMemory Limit:65536KTotal Submissions:9170Accepted:3092DescriptionTwo positive integers are said to be relatively prime to e... 阅读全文
posted @ 2014-05-19 19:08 炒饭君 阅读(145) 评论(0) 推荐(0) 编辑
POJ 2318 TOYS
摘要： TOYSTime Limit:2000MSMemory Limit:65536KTotal Submissions:9955Accepted:4754DescriptionCalculate the number of toys that land in each bin of a partitio... 阅读全文
posted @ 2014-05-19 16:53 炒饭君 阅读(106) 评论(0) 推荐(0) 编辑