摘要：
Wang Xifeng's Little Plot Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1301 Accepted Submissio 阅读全文
摘要：
C. Short Program time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Petya learned a new pro 阅读全文
摘要：
B. Ralph And His Magic Field time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Ralph has a 阅读全文
摘要：
The ant Welly now dedicates himself to urban infrastructure. He came to the kingdom of numbers and solicited an audience with the king. He recounted h 阅读全文
摘要：
Consider a un-rooted tree T which is not the biological significance of tree or plant, but a tree as an undirected graph in graph theory with n nodes, 阅读全文
摘要：
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 阅读全文
摘要：
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 阅读全文
摘要：
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 阅读全文
摘要：
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 阅读全文
摘要：
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 阅读全文