→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/25/2026 14:30:15 (g2).
Desktop version, switch to mobile version.
Supported by
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/