← Back to List

14040번: Hidden Palindrome ↗

Solutions

Python 3
655 B | 655 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)

BLANK = " "

# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print

  
def solve():
  mx = 0
  s = input()
  
  for i in range(len(s)):
    for j in range(i + 1, len(s) + 1):
      k = s[i:j]
      
      if k == k[::-1]:
        mx = max(mx, j - i)
  p(mx)
  
if __name__ == "__main__":
  tc = 1

  for t in range(1, tc+1):
    ret = solve()