top of page

CCC 2019 J3: Cold Compress


Solution:

Count each identity characters, if character x 's counter is n, add string n + " " + x to its result string. After iterate, the input string, print the result string.


def printx(n, x):
    return str(n) + " " + x

m = int(input())
for i in range(m):
    sr = input()
    rs = ""
    x = sr[0]
    i = 1
    n = 1
    while i < len(sr):
        if sr[i] == x:
            n += 1
        else:
            rs += printx(n, x)+" "
            n = 1
            x = sr[i]
        i += 1
    rs += printx(n,x)
    print(rs)


Recent Posts

See All

CCC '24 J5 - Harvest Waterloo

#include<iostream> #include <vector> #include <algorithm> #include <cmath> #include <stack> using namespace std; int main() { int r, c, sr, sc; cin >> r; cin >> c; int p[r][c]; bool v

CCC '24 J4 - Troublesome Keys

#include <iostream> #include <string> #include <map> #include <vector> #include <algorithm> #include <cmath> using namespace std; int main() { string ps; string ds; cin >> ps; cin >> ds;

CCC '22 J5 - Square Pool

#include<iostream> #include <vector> #include <algorithm> #include <cmath> using namespace std; bool rowcom(pair<int, int> a, pair<int, int> b){ return a.first < b.first; } bool colcom(pair<int,

Commenti


bottom of page