Hello CF comunity, today i want to share my greatest achievement. After 1 week of thinking for a solution and 3 hard days of implementation i finally managed to get 100 point on the one and only textmare. Here is a link if u want to try this imposable problem. https://kilonova.ro/problems/199/
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | jiangly | 3734 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | ecnerwala | 3581 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3479 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 162 |
| 2 | maomao90 | 160 |
| 3 | nor | 156 |
| 4 | cry | 155 |
| 4 | adamant | 155 |
| 4 | atcoder_official | 155 |
| 4 | -is-this-fft- | 155 |
| 8 | maroonrk | 153 |
| 9 | Petr | 146 |
| 10 | SecondThread | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 24.08.2024 11:21:47 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by activedeltorre (previous revision, new revision, compare).
Auto comment: topic has been updated by activedeltorre (previous revision, new revision, compare).
Congrats my friend. Keep Progressing
Thank you, GL in your CP journey.
For anyone wondering what the problem asks you to solve, it gives you a big(mare)string of N characters (N<=100000) and M words (M<500000 sum of number of charaters of the M words<=500000) and u have to split the big string into the smallest numer of words (if u can t split it u have to output 0).
wow, you realy proved yourself with this problem, well done my friend