Div1C2 editorial mentions "the number of pairs of non-concentric substrings with a total length of $s$", but doesn't describe the way to find this number. Seems not obvious to me. Tried googling and stuff. No convolutions are required for this, right?
Div1C2 editorial mentions "the number of pairs of non-concentric substrings with a total length of $s$", but doesn't describe the way to find this number. Seems not obvious to me. Tried googling and stuff. No convolutions are required for this, right?