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 | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
[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 |
---|