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 | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 165 |
3 | Um_nik | 161 |
3 | atcoder_official | 161 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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 |
---|