Boring counting 的写法

Question

Problem Description
035 now faced a tough problem,his english teacher gives him a string,which consists with n lower case letter,he must figure out how many substrings appear at least twice,moreover,such apearances can not overlap each other.
Take aaaa as an example.”a” apears four times,”aa” apears two times without overlaping.however,aaa can’t apear more than one time without overlaping.since we can get “aaa” from 0-2 and [1-3]. But the interval [0-2] and [1-3] overlaps each other.So “aaa” can not take into account.Therefore,the answer is 2(“a”,and “aa”).

Input
The input data consist with several test cases.The input ends with a line “#”.each test case contain a string consists with lower letter,the length n won’t exceed 1000(n <= 1000).

Output
For each test case output an integer ans,which represent the answer for the test case.you’d better use int64 to avoid unnecessary trouble.

Sample Input
aaaa
ababcabb
aaaaaa
#

Sample Output
2
3
3

Answer 1

以下回答参考 皆我百晓生、券券喵儿 等免费微信小程序相关内容作答，并由本人整理回复。

# 读取测试数据
test_data <- readLines()

# 初始化答案列表
ans_list <- numeric(length(test_data))

# 遍历每个测试案例
for (i in seq_along(test_data)) {
  # 提取当前测试案例的字符串
  current_str <- test_data[[i]][1:(length(test_data[[i]]) - 1)]
  
  # 计算所有可能的子串数量
  substring_count <- length(grep(current_str, current_str, fixed = TRUE))
  
  # 更新答案列表
  ans_list[i] <- substring_count
  
}

# 输出结果
write.table(ans_list, file="output.txt", sep="\t", quote=F, col.names=TRUE)