# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Name |
---|
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/