Submission #998517

#	Time	Username	Problem	Language	Result	Execution time	Memory
998517		Ibrohim0704	Palindromes (APIO14_palindrome)	Cpython 3	0 / 100	1074 ms	3676 KiB

palindrome

a=str(input())
def palin(s):
    if s==s[::-1]:
        return True
    return False
def cou(s,el):
    ret=0
    for i in range(len(s)):
        c=0
        for j in range(len(el)):
            if i+j<len(s):
                if s[i+j]==el[j]:
                    c+=1
        if c==len(l):
            ret+=1
    return ret
ans=[]
for i in range(len(a)):
    for j in range(len(a)):
        l=a[i:j+1]
        k=palin(l)
        if k:
            ans.append(len(l)*(cou(a,l)))
print(max(ans))       

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 26
• Subtask 5: 0 / 27