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 | Benq | 3783 |
2 | jiangly | 3666 |
3 | tourist | 3611 |
4 | Um_nik | 3536 |
5 | inaFSTream | 3477 |
6 | fantasy | 3468 |
7 | maroonrk | 3464 |
8 | QAQAutoMaton | 3428 |
9 | ecnerwala | 3427 |
10 | Ormlis | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 185 |
2 | adamant | 177 |
2 | awoo | 177 |
4 | nor | 169 |
5 | maroonrk | 165 |
6 | -is-this-fft- | 164 |
7 | antontrygubO_o | 155 |
8 | ko_osaga | 151 |
8 | dario2994 | 151 |
10 | SecondThread | 149 |
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 |
---|