23A (Accepted)

This commit is contained in:
2026-05-09 02:40:50 +02:00
parent c0aa29791f
commit 31bd604934

View File

@@ -0,0 +1,17 @@
# https://codeforces.com/problemset/problem/23/A
def solve():
string = input()
best = 0
for offset in range(1, len(string)):
for start in range(len(string)):
i = 0
while i + offset + start < len(string) and string[i + start] == string[i + offset + start]:
i += 1
if i > best:
best = i
print(best)
solve()