CF932G Palindrome Partition

Given a string $ s $ , find the number of ways to split $ s $ to substrings such that if there are $ k $ substrings $ (p_{1},p_{2},p_{3},...,p_{k}) $ in partition, then $ p_{i}=p_{k-i+1} $ for all $ i $ $ (1

N/A

N/A

In the first case, the only way to partition the string is $ ab|cd|cd|ab $ . In the second case, the string can be partitioned as $ ab|b|ab|ab|ab|ab|b|ab $ or $ ab|b|abab|abab|b|ab $ or $ abbab|ab|ab|abbab $ .