| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 136 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
| 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