hello codeforces <3
i wanna talk about uva 11475 problem
firstly this is my solution: https://ideone.com/YbEC16
i got ac using this code :)
but when i open udebug and try morass case it get wrong answoer :(
i wanna talk about my solution:
firstly i get the largest palindrome from the end of the string
let N = (len(string)-len(largest palindrom from the end of the string))
after this i print the original string + the first N characters after reverse it
thank you all and iam sorry for my bad english