2013年5月16日
uva 10795 - A Different Task（递推，3级）
摘要： A Different TaskThe (Three peg) Tower of Hanoi problem is a popular one in computer science. Briefly the problem is to transfer all the disks from peg-Ato peg-Cusing peg-Bas intermediate one in such a way that at no stage a larger disk is above a smaller disk. Normally, we want the minimum number of 阅读全文
posted @ 2013-05-16 17:39 剑不飞 阅读(213) 评论(0) 推荐(0)
uva 12124 - Assemble（二分定界，4级）
摘要： Problem A - AssembleTime limit: 2 secondsRecently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new computer.To make the ideal computer for your needs, you decide to buy separate components and assemble the 阅读全文
posted @ 2013-05-16 17:30 剑不飞 阅读(197) 评论(0) 推荐(0)