The problem: Find the nth number that has it's sum of digits divisible by 10. (n <= 10^15) I can only think of digit DP, but I'm trying to think of a simpler way. If anyone can help me, please do.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Kevin114514 | 3655 |
| 3 | Benq | 3650 |
| 4 | maroonrk | 3427 |
| 5 | strapple | 3413 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | tourist | 3301 |
| 9 | turmax | 3297 |
| 10 | squareOf105 | 3262 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 2 | nik_exists | 150 |
| 4 | Um_nik | 145 |
| 5 | Errichto | 139 |
| 6 | adamant | 136 |
| 7 | maroonrk | 134 |
| 7 | AmShZ | 134 |
| 9 | BledDest | 133 |
| 10 | DNR | 131 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/15/2026 20:43:41 (g2).
Desktop version, switch to mobile version.
Supported by
