I want to find the number of strings 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.
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
[HELP] combinatorics on strings
I want to find the number of strings 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.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en5 |
![]() |
baddestguy | 2020-06-29 18:48:16 | 53 | ||
en4 |
![]() |
baddestguy | 2020-06-29 18:03:12 | 6 | Tiny change: 'ler than A, that has subst' -> 'ler than A and has subst' | |
en3 |
![]() |
baddestguy | 2020-06-29 17:50:28 | 27 | Tiny change: 'f strings smaller t' -> 'f strings that are lexicographically smaller t' | |
en2 |
![]() |
baddestguy | 2020-06-29 17:37:30 | 12 | Tiny change: 'n A, that contains a string B. ' -> 'n A, that has substring B. ' | |
en1 |
![]() |
baddestguy | 2020-06-29 16:56:43 | 277 | Initial revision (published) |
Name |
---|