| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Codeforces Round 952(DIV 4) doubt, Problem G
For numbers with l+1 digits, there are floor(9/k) (say a) options per digit, hence the total number of numbers should be a^(l+1). Similarly, for l+2 digits, a^(l+2). So on for r digits, a^(r).
Shouldn't the answer be the sum of these numbers?
a^(l+1) + a^(l+2) + .... + a^r
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
ayushanshul07 | 2024-06-15 07:04:55 | 4 | Tiny change: 'loor(9/k) (say a) o' -> 'loor(9/k) + 1 (say a) o' | |
| en1 |
|
ayushanshul07 | 2024-06-15 06:53:32 | 347 | Initial revision (published) |
