2015年10月21日
HDU 4932 Miaomiao's Geometry（BestCoder Round #4）
摘要： Problem Description：There are N point on X-axis . Miaomiao would like to cover them ALL by using segments with same length.There are 2 limits:1.A poin... 阅读全文
posted @ 2015-10-21 16:54 搁浅の记忆 阅读(171) 评论(0) 推荐(0)
HDU 4908 BestCoder Sequence（BestCoder Round #3）
摘要： Problem Description：Mr Potato is a coder.Mr Potato is the BestCoder.One night, an amazing sequence appeared in his dream. Length of this sequence is o... 阅读全文
posted @ 2015-10-21 14:43 搁浅の记忆 阅读(205) 评论(0) 推荐(0)
HDU 4883 TIANKENG’s restaurant（BestCoder Round #2）
摘要： Problem Description：TIANKENG manages a restaurant after graduating from ZCMU, and tens of thousands of customers come to have meal because of its deli... 阅读全文
posted @ 2015-10-21 14:15 搁浅の记忆 阅读(147) 评论(0) 推荐(0)