CT25686

The Ribbon Compression of the Solar charms

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Caravans arrive at the seal rocks of Barking Cove with crates of charms, and Chaplain the clerk must account for every last one. Task: Compress s using run-length encoding: replace each maximal run of equal characters c repeated k times by c followed by k. Input format: One line with a single lowercase string s. Output format: Print the encoded string. Constraints: 1 <= |s| <= 620; s contains lowercase English letters.

Example 1:

Input: jjvnnnnnndkkkkkkeeeeaaaappeeeeeennnbmyyyyyzzzzzzhhtttttpppppvzzzzzzttttthhhgrrrryyffffmmmmhhhhhhfllggggffqqeeiiiddddvbbrrrrddddzuuuuuueeeeeefffffiiwwyggggggttt
Output: j2v1n6d1k6e4a4p2e6n3b1m1y5z6h2t5p5v1z6t5h3g1r4y2f4m4h6f1l2g4f2q2e2i3d4v1b2r4d4z1u6e6f5i2w2y1g6t3

Example 2:

Input: aaoooohhhhhhffffuuuuuuuuuuuuppp
Output: a2o4h6f4u12p3

Example 3:

Input: gggghhhkkknnnnnnvvvvvlllllmmmmmmaaqqqqqquuufffffoooommmmmmmmhhhhhhdpppppppddddddmmmaayyyynnnnnndddwuuuuurrrriizzzzzzgeeeeeeeeeeelllvvvvveeeeeewwwwwoooookkkkkktttttmmmmiiiiihhhhhhssscssssssaaaassuuuuuxssmmmlliiiiikkkkkjjjjjjrrrrrqqqqqccccciiiiiicccebbbbbbyyyyyeyyyyyyyiiiiiimmmmyyssssssuuuueeddddvvvvuuuuuuoonzzzztttvvvccccccddddddccccctttxiiiiishvvlllqqsssjjjyyyvvvvvvgggggqqqfffaaautttttoppjjjjjjiiigonmppaaazzzzzzjjjjjjh
Output: g4h3k3n6v5l5m6a2q6u3f5o4m8h6d1p7d6m3a2y4n6d3w1u5r4i2z6g1e11l3v5e6w5o5k6t5m4i5h6s3c1s6a4s2u5x1s2m3l2i5k5j6r5q5c5i6c3e1b6y5e1y7i6m4y2s6u4e2d4v4u6o2n1z4t3v3c6d6c5t3x1i5s1h1v2l3q2s3j3y3v6g5q3f3a3u1t5o1p2j6i3g1o1n1m1p2a3z6j6h1

Constraints:

1 <= |s| <= 620; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.