2019年9月27日
FZU-1901-Period 2(KMP)
摘要： 链接: https://vjudge.net/problem/FZU 1901 题意: For each prefix with length P of a given string S,if S[i]=S[i+P] for i in [0..SIZE(S) p 1], then the prefi 阅读全文
posted @ 2019-09-27 16:28 YDDDD 阅读(171) 评论(0) 推荐(0)
HDU-2609-How many(最小表示法)
摘要： 链接: https://vjudge.net/problem/HDU 2609 题意: Give you n ( n 1100 1001 0011 0110. 思路: 找到每个字符串的最小表示法.加到set里去重即可. 代码: c++ include include include include 阅读全文
posted @ 2019-09-27 15:45 YDDDD 阅读(166) 评论(0) 推荐(0)