要努力成为别人的依赖 弱弱一枚 halfyarn
  半根毛线 计数er: AmazingCounters.com 位小伙伴来看过~

2016年5月15日

摘要: Problem A Accepts: 1551 Submissions: 11043 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem A Accepts: 1551 Su 阅读全文
posted @ 2016-05-15 16:59 半根毛线 阅读(213) 评论(0) 推荐(0) 编辑
 
摘要: Problem E: Balance Description Every night Diao Ze is dreaming about the gold medal in the <!--?mso-application progid="Word.Document"?--> 1540th"> AC 阅读全文
posted @ 2016-05-15 16:52 半根毛线 阅读(175) 评论(0) 推荐(0) 编辑
 
摘要: Problem B: Handing Out Candies Description After the 40th ACM-ICPC, Diao Yang is thinking about finding a girlfriend because he feels very lonely when 阅读全文
posted @ 2016-05-15 16:26 半根毛线 阅读(183) 评论(0) 推荐(0) 编辑
 
摘要: Problem I: Catching Dogs Description Diao Yang keeps many dogs. But today his dogs all run away. Diao Yang has to catch them. To simplify the problem, 阅读全文
posted @ 2016-05-15 15:57 半根毛线 阅读(175) 评论(0) 推荐(0) 编辑
 
摘要: Problem J: Arithmetic Sequence Description Giving a number sequence A with length n, you should choosing m numbers from A(ignore the order) which can 阅读全文
posted @ 2016-05-15 15:17 半根毛线 阅读(221) 评论(0) 推荐(0) 编辑
 
halfyarn@gmail.com