1199 : Substrings Same as Prefix
- 时间限制Time Limit
- 1 秒Sec
- 内存限制Memory Limit
- 128 兆MB
- 提交次数Submitted
- 1,339 次Times
- 通过次数Solved
- 359 次Times
标准评测 Standard
从标准输入读入,结果写到标准输出。评测将输出拆成 token,与标准答案逐项比较,不按整段逐字节比对。
Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.
| 比对Compare | token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored. |
|---|---|
| 不同则错Differs | token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ. |
| 输入Input | 标准输入,格式见题面。Standard input; format as in the statement. |
| 输出Output | 标准输出。Standard output. |
| 时间与内存Time and memory | 记这一份程序的 CPU 时间和内存峰值。题目上的时间限制、内存限制就是这一份的上限。The record is this program’s CPU time and peak memory. The limits on the problem apply to this one run. |
题目描述Description
We want to know how similar the content of a string is to its prefix.
A string could gain a score of k when there is a non-prefix
substring of length k that is the same as its prefix. Find
the total score for a string.
输入格式Input
There are 20 test cases. Each case contains a string of
English letters with length n.
\(1 \leq n \leq 10^5\)
输出格式Output
Each case one line, the score of the string.
样例Sample
提示Hint
For the first case, “a”, “ab”,
“abc” are non-prefix substrings same as prefix and the
score is 1+2+3=6.
For the second case, 3 “a”s, 2
“aa”s and 1 “aaa” are non-prefix
substrings same as prefix. Then the score is 3+4+3=10.
出题Author
CSGrandeur
来源Source
湖南省第十八届大学生计算机程序设计竞赛(HNCPC2022)
题目到此结束End of problem