|
Matcom Online Grader
Faculty of Mathematics and Computer Science of University of Havana
ℹ️ We've recently migrated MOG to a new server with a different grader. As a result, some features—especially those related to submission evaluation—might not work correctly. If you encounter any issues, please report them by clicking the exclamation icon in the bottom right corner of the website.
ACM 2016 - Round #3Ended |
E - Dos Palíndromos
Languages: C, C++, Java, Pascal, Python, Tiger, JavaScript, Haskell, C#
Time & Memory limits: (details)
Para este sencillo problema a Fito se le han dado dos strings S , T y lo que se quiere es determinar la cantidad de cuadruplas $(a, b, c, d)$ tal que los substrings $S[a, b]$ y $T[c, d]$ son iguales y palindromos.
Input
La entrada contiene dos lineas con los strings S y T , $(|S| , |T| <= 200000)$.
Output
La cantidad requerida.
Sample test(s)
Input
aaa
aa
Output
8
Input
ab
ab
Output
2