| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
Math Online Assessment Question
Problem : Given a number k, find a k-digit string where the product of its digits is greater than or equal to the sum of its digits. If there are multiple such strings, return the one with the minimum product. If there are still ties, return the lexicographically smallest string.
Testcases:
Input : 1 Output : 1
Input : 2 Output : 22
Input : 3 Output : 123
Input : 4 Output : 1124
Input : 5 Output : 11222
Input : 6 Output : 111223
Constraints:
1 <= K <= 100000
How to solve this? Please help!
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Summer_Wind | 2024-08-05 20:30:07 | 4 | Tiny change: 'tput : 111223\n\n**Cons' -> 'tput : 111126\n\n**Cons' | |
| en1 |
|
Summer_Wind | 2024-08-04 21:23:19 | 581 | Initial revision (published) |
