摘要：
Now you are back,and have a task to do: Given you a string s consist of lower-case English letters only,denote f(s) as the number of distinct sub-stri 阅读全文
posted @ 2017-10-21 18:38
hinata_hajime
阅读(165)
评论(0)
推荐(0)
摘要：
Good Article Good sentence In middle school, teachers used to encourage us to pick up pretty sentences so that we could apply those sentences in our o 阅读全文
posted @ 2017-10-21 16:02
hinata_hajime
阅读(266)
评论(0)
推荐(0)
摘要：
Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowing that, his friend Kinan decided to test his 阅读全文
posted @ 2017-10-21 15:14
hinata_hajime
阅读(188)
评论(0)
推荐(0)
摘要：
You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with 阅读全文
posted @ 2017-10-21 14:00
hinata_hajime
阅读(178)
评论(0)
推荐(0)
摘要：
A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called fa 阅读全文
posted @ 2017-10-21 11:19
hinata_hajime
阅读(237)
评论(0)
推荐(0)
浙公网安备 33010602011771号