→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 161 |
| 4 | Um_nik | 159 |
| 4 | atcoder_official | 159 |
| 6 | djm03178 | 157 |
| 7 | adamant | 153 |
| 8 | luogu_official | 151 |
| 9 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2025 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 31.01.2025 15:05:20 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
Given the small constraints, you can just generate the string until the nth-ish digit by adding each number to it
then access the nth index
I would recommend solving the harder problem, with n<10^18
How will we approach for large constraints sir ?
I think revealing the answer right away will miss the point, so instead I'll direct you by giving a little hint: try to figure out which number contains the nth digit then figure out which digit in the number the nth digit contains
Problem link: https://cses.fi/problemset/task/2431
My solution for reference: https://cses.fi/paste/62e169b7b0d1f9ef398110/