2015年4月15日

ACM学习历程——HDU5202 Rikka with string(dfs,回文字符串)

摘要: Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is o... 阅读全文

posted @ 2015-04-15 22:14 AndyQsmart 阅读(232) 评论(0) 推荐(0)

ACM学习历程——hihoCoder挑战赛10A 01串(策略)

摘要: 时间限制:7000ms单点时限:1000ms内存限制:256MB描述给定两个整数n和m,求是否存在恰好包含n个0和m个1的01串S,使得S中不存在子串"001"和"11"。如果存在符合条件的01串则输出字典序最小的S,否则输出NO。输入一行两个整数,表示n和m。(0#include #include... 阅读全文

posted @ 2015-04-15 22:07 AndyQsmart 阅读(244) 评论(0) 推荐(0)

ACM学习历程——POJ3468 A Simple Problem with Integers(线段树)

摘要: DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to ... 阅读全文

posted @ 2015-04-15 21:54 AndyQsmart 阅读(171) 评论(0) 推荐(0)

导航