| # | User | Rating |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 164 |
| 3 | awoo | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 155 |
| 6 | maroonrk | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Convolution and String Matching (small alphabet)
Hi Codeforces community! I wanted to write this blog entry to help coders who would like to see a nice example of convolutions used in a problem which, at first sight, has little to no relation with polynomial multiplication (of course it has, it's a convolution after all)
The problem is as follows: You are given two strings S and P, with lengths n and m respectively, where m ≤ n
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en6 |
|
snacache | 2018-05-11 05:08:43 | 4 | ||
| en5 |
|
snacache | 2018-05-11 00:23:31 | 17 | Tiny change: 'f_{a_i}(j) + f^{c}_{a_i}(j)}' -> 'f_{a_i}(j)}' | |
| en4 |
|
snacache | 2018-05-10 23:54:16 | 62 | ||
| en3 |
|
snacache | 2018-05-10 23:49:52 | 2787 | Tiny change: '$ memory.<\b>\n\nThis' -> '$ memory.</b>\n\nThis' (published) | |
| en2 |
|
snacache | 2018-05-10 21:17:51 | 2109 | Tiny change: 'y, where $m\leqn$' -> 'y, where $n\beqm$' | |
| en1 |
|
snacache | 2018-05-10 19:07:47 | 444 | Initial revision (saved to drafts) |
