| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
In 09.03.2019 there will be COCI exam in this link: http://hsin.hr/coci/ You can study for the old COCI's here: https://oj.uz/problems/source/122 Also this site has an online judge. The contest will begin at:09.03.2019 14:00 GMT/UTC and it will take three hours.
UPD1: Last 4 hours...
Thank you for announcement.
Np.
Auto comment: topic has been updated by Ahmet.K37 (previous revision, new revision, compare).
Last 3 days.
Auto comment: topic has been updated by Ahmet.K37 (previous revision, new revision, compare).
Let me give Sličice's solution. You will do dp for this question.You will keep two things in recursive.(Index and how many bonus you have)
Then you use for in recursive for how many times you use bonus for this index . Then you will take max.
This is the code: https://paste.ubuntu.com/p/twNKyCZBjS/