| # | 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 |
Explanation for the mathematical solution for atcoder problem E — Σ[k=0..10^100]floor(X／10^k)
Hello codeforces, I solved This problem from atcoder with the "Obvious" brute-force solution which is O(N). But when I take a look at the editorial I found a Beautiful mathematical solution that solves it in O(1). But unfortunately, I didn't understand it so Can anyone please explain it to me?
I really appreciate any help you can provide.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
Omar_Hafez | 2022-05-28 12:35:44 | 97 | Tiny change: 'ves it in O(1). \nBut un' -> 'ves it in <strike>TO(1)</strike>T. \nBut un' | |
| en2 |
|
Omar_Hafez | 2022-05-27 21:49:07 | 5 | ||
| en1 |
|
Omar_Hafez | 2022-05-27 21:48:12 | 553 | Initial revision (published) |
