| # | 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 | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
Say we are given the number of occurrences of each letter (lower case english alphabet). We have to find the number of all k length strings (unique) that can be formed using these letters (MOD 1e9 +7).
Example: a:2, b:1, c:1
k = 2
aa ab ac bc ca cb ba
Answer: 7
Constraints:
k <= 1e5
Total number of characters <= 1e5
I couldn't solve it. Any input is appreciated.
I submitted a solution to the Problem C of today's contest that works fine in my computer and other online IDE's that I have checked. But for some reason that I couldn't figure out I get a runtime error in codeforces. Can someone please show me what's wrong with my code. Problem:898C - Phone Numbers Submission:33317474
