![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_扩展KMP
cowboy90
这个作者很懒,什么都没留下…
展开
-
Best Reward (扩展KMP+回文串)
http://acm.hdu.edu.cn/showproblem.php?pid=3613 Best Reward Problem Description After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with hono转载 2013-10-01 13:58:28 · 677 阅读 · 0 评论 -
Revolving Digits (扩展KMP)
http://acm.hdu.edu.cn/showproblem.php?pid=4333 Revolving Digits Problem Description One day Silence is interested in revolving the digits of a positive integer. In the revolving operation,原创 2013-10-01 19:45:19 · 721 阅读 · 0 评论