CT24830

Nina and the Jade sigils

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Morning light hits the singing sands of Echo Dunes as Nina unrolls the day's manifest of sigils. The tally will decide the next shipment. 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| <= 1256; s contains lowercase English letters.

Example 1:

Input: eeeexxssssssiiiiiinnnnnbaaaaassszzzzvvvmmmmmjjnppssmmmuuuuuwwwwwxxxxxxuuuuusssssqqqqxxxxxabbbbbbigggcxxgggggpppppmmabccchhbbbbbohhhaaaaoorrrqqqqqqyyyyvvffwwwwwwwhhyyyyyytttttdddlmmmssssssiiwwwwmmmmmggccffxxxbbbbbkkkeebqqqqqqqqqqqqyyyyycczzzzzmmmmmmmmmmtttbhhhhhheggtttttwwwwwwpiikjjkkkkkkgyyyhooooovvvzzzkkhhhhvvvgiiiieeeeemyyyymmmmmrrrrrrffffffjjjjjccccceeeddd
Output: e4x2s6i6n5b1a5s3z4v3m5j2n1p2s2m3u5w5x6u5s5q4x5a1b6i1g3c1x2g5p5m2a1b1c3h2b5o1h3a4o2r3q6y4v2f2w7h2y6t5d3l1m3s6i2w4m5g2c2f2x3b5k3e2b1q12y5c2z5m10t3b1h6e1g2t5w6p1i2k1j2k6g1y3h1o5v3z3k2h4v3g1i4e5m1y4m5r6f6j5c5e3d3

Example 2:

Input: qqdqqqaaccccllaanngggeeeeehhhhhoooooorcuuuurrkkkkhhhhhhbbbbbeeeeeexzzzzzzzzzggvvyyzzzzzzeeekkkkffffffqqqowweeesyyyyyywwwwwggggggbbeeepppppvvvrrrrffffffjjzzzzzzaayyvvttttttddddddiuddddiaaaaaajjjjsswwgggggkkkkkssuuurrzvvvvvvmmmmwwwkkkkaaannnnnnttlrrrrvvvyyyyyysssbbbffffffoooddddjaassssiiiiiiooooqqqqoooooonnnnnnhhhhhhgggggssssswwwwsssptllllllllsssssaagqqiiiiiizssyyyyynnkkcggggggoooyyyyyjjjjjjyyyzzzzzzzzzzzyyyyyyccccckkkkkssssssxuuuuuzzzccccccmmmmyyjjjjjgggggsssmmmjjjhhhhhhssssssnnnlsssssbbbbawwwibbbbguuuueeeeeeqqqyybbbbbgggggkkvvvvmmmmezzzzrkkvkkkkqlllllddddwzssshhheeeeeewwwwqqqqcccccweooozzzfffffxtttttgf
Output: q2d1q3a2c4l2a2n2g3e5h5o6r1c1u4r2k4h6b5e6x1z9g2v2y2z6e3k4f6q3o1w2e3s1y6w5g6b2e3p5v3r4f6j2z6a2y2v2t6d6i1u1d4i1a6j4s2w2g5k5s2u3r2z1v6m4w3k4a3n6t2l1r4v3y6s3b3f6o3d4j1a2s4i6o4q4o6n6h6g5s5w4s3p1t1l8s5a2g1q2i6z1s2y5n2k2c1g6o3y5j6y3z11y6c5k5s6x1u5z3c6m4y2j5g5s3m3j3h6s6n3l1s5b4a1w3i1b4g1u4e6q3y2b5g5k2v4m4e1z4r1k2v1k4q1l5d4w1z1s3h3e6w4q4c5w1e1o3z3f5x1t5g1f1

Example 3:

Input: hhhhhkkkkkoooooottwwwwwooffxxxxxxppddddxxhhhhhbbbbuuuuoooobbbeeeeggggukuuuueeeeemmmppppppvvfffffffpvffffjjjjaaaaaajjjjjjjjgggggzppclllleeeeeezzzuuuzzzzzkkkkxxxaaaaaybblllllldddmmkkkkkkassssiiiiiddvvoohhhiirrrrppppasssqqqqqqplllllddkkkkkvvvvvvggmmmmmmgiiiilljjjjjjhhhhczzzzzzkkkkrkkkkkkaaeeeennnnccchhhhhhxxxxqqqlggnaaaaaammmkkkkktttttnnnbbxdgggooooqffffffaaqqqkkyybbozmjmmmmmmgiiihhhxxxxxxllllllffaaaaaqqqqqqrrrrrrxxxxlppppppkkkkkkuuggglllluuuuuaaaaaappppwwwwuuuuvffffffeeeeeeedddxxjjjjzzzllllwwwwxiissswwwwwwwfmmpvvqqqqbpppccooooooeeeennaaaaaannnnnjggggggjjjjjiiiiuuuuummjjjrfqqqqqqvvvvkkkkkkiiiyyyyjjjjnnnnnqeeeeejjppppggcccodddduuwwttlllssssqqqgwwwwnnvvaaqqpp
Output: h5k5o6t2w5o2f2x6p2d4x2h5b4u4o4b3e4g4u1k1u4e5m3p6v2f7p1v1f4j4a6j8g5z1p2c1l4e6z3u3z5k4x3a5y1b2l6d3m2k6a1s4i5d2v2o2h3i2r4p4a1s3q6p1l5d2k5v6g2m6g1i4l2j6h4c1z6k4r1k6a2e4n4c3h6x4q3l1g2n1a6m3k5t5n3b2x1d1g3o4q1f6a2q3k2y2b2o1z1m1j1m6g1i3h3x6l6f2a5q6r6x4l1p6k6u2g3l4u5a6p4w4u4v1f6e7d3x2j4z3l4w4x1i2s3w7f1m2p1v2q4b1p3c2o6e4n2a6n5j1g6j5i4u5m2j3r1f1q6v4k6i3y4j4n5q1e5j2p4g2c3o1d4u2w2t2l3s4q3g1w4n2v2a2q2p2

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Nina and the Jade sigils - EASY Coding Problem | CodeTikki