| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 3 | cry | 159 |
| 5 | atcoder_official | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 149 |
Question C — Ubiquity of Atcoder Beginner contest 178
How many integer sequences A1, A2,…, AN of length N satisfy all of the following conditions? 0≤Ai≤9 There exists some i such that Ai=0 holds. The answer can be very large, so output it modulo 10^9+7.
Explain this question please, and what should I learn to solve such types of questions?. Thank YOU
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
seemyprogressnothandle | 2020-09-13 20:11:17 | 45 | ||
| en1 |
|
seemyprogressnothandle | 2020-09-13 20:07:37 | 399 | Initial revision (published) |
