CF23A.You're Given a String...
普及/提高-
通过率：0%
AC君温馨提醒
该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。
题目描述
You're given a string of lower-case Latin letters. Your task is to find the length of its longest substring that can be met in the string at least twice. These occurrences can overlap (see sample test 2).
输入格式
The first input line contains the string. It's guaranteed, that the string is non-empty, consists of lower-case Latin letters, and its length doesn't exceed 100.
输出格式
Output one number — length of the longest substring that can be met in the string at least twice.
输入输出样例
输入#1
abcd
输出#1
0
输入#2
ababa
输出#2
3
输入#3
zzz
输出#3
2