| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 161 |
| 2 | adamant | 149 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | TheScrasse | 133 |
| Name |
|---|



This problem wants you to make the given string a 'k' copy of some random string. Suppose that random string contain a character say 'c' in it x times. So in the given string 's' it will be exactly k*x times. So first just calculate all occurrences of all characters, and check if it is perfectly divided by k or not, if it doesn't return -1 else print n copies of the string which will contain all characters 1/n times of its total.
Totally appreciate your effort! My code does that only ig,then why the test case 10 is failing I can't get that!
No you didn't do it that way. Lemme edit your code and send you. Maybe now you can understand your mistake. <3