[HELP] combinatorics on strings

Revision en3, by baddestguy, 2020-06-29 17:50:28

I want to find the number of strings that are lexicographically smaller than A, that has substring B. e.g. A = "da" and B = "c" then answer = 29: {'c', 'ac', 'bc', cX}, where X is any alphabet. also, constraints are pretty low, 1 <= |B|,|A| <= 1000 Please help thanks.

Tags #strings, #combinatorics, #maths, inclusion-exclusion

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English baddestguy 2020-06-29 18:48:16 53
en4 English baddestguy 2020-06-29 18:03:12 6 Tiny change: 'ler than A, that has subst' -> 'ler than A and has subst'
en3 English baddestguy 2020-06-29 17:50:28 27 Tiny change: 'f strings smaller t' -> 'f strings that are lexicographically smaller t'
en2 English baddestguy 2020-06-29 17:37:30 12 Tiny change: 'n A, that contains a string B. ' -> 'n A, that has substring B. '
en1 English baddestguy 2020-06-29 16:56:43 277 Initial revision (published)