摘要:
其实用处不大 acm卡常没什么意思 原理就是getchar()很快 阅读全文
摘要:
Problem Description Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell meHow many kinds of necklaces total have.(i 阅读全文
摘要:
Problem Description Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can 阅读全文
摘要:
最小表示法是求与某个字符串循环同构的所有字符串中,字典序最小的串是哪个。比如说一个字符串jdrakioi,它长为8,也就是说最多有八种循环同构的方法。jdrakioi、drakioij、rakioijd、akioijdr、kioijdra、ioijdrak、oijdraki、ijdrakio。这几个 阅读全文