1808D - Petya, Petya, Petr, and Palindromes
1808E1 - Minibuses on Venus (easy version)
1808E2 - Minibuses on Venus (medium version)
1808E3 - Minibuses on Venus (hard version)
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
1808D - Petya, Petya, Petr, and Palindromes
1808E1 - Minibuses on Venus (easy version)
1808E2 - Minibuses on Venus (medium version)
1808E3 - Minibuses on Venus (hard version)
1775A1 - Gardener and the Capybaras (easy version)
1775A2 - Gardener and the Capybaras (hard version)
1775B - Gardener and the Array
Now it is time for the bonus task and author solutions!
Problem A can be solved for $$$O(n)$$$ even if the alphabet consists of all letters. Think about how this can be done.
The size of the second string is $$$1$$$. You can just go through it.
I congratulate YouKn0wWho for breaking into the top-1 of contribution with the help of the best and most useful blogs.
Name |
---|