Kalindrome Strings (kalindrome)

145 teams scored 11140 points on this task, for a maximum score of 100, an average score of 77 and a median score of 100.

Highlights

  1. Carlo Zuccante, Venezia is the institute with the most points (420).
  2. Lombardia is the region with the most points (2160).

Statement

William loves strings and their properties, and he is especially fond of palindromes. He likes palindromes so much, that he started reading lots of research papers on them and finally stumbled upon a new kind of property that generalizes the palindrome concept: the kalindrome. We say that a string is a kalindrome if, for some positive integer K, it's possible to split the string in many substrings, each of them K characters long, so that they can be "read" from left to right in the same way as right to left. More precisely: if we concatenate the substrings starting from the last one, we will recreate the original string. For example: the word "banaba" is a kalindrome, because if we choose K=2 then we obtain the substrings: ba, na, ba, which can indeed be concatenated starting from the last one, to reconstruct the original word...