Monistus

# You are given a string that consists of letters a–z and digits 1–9.
# The following operation is repeated, until there are no digits left in the
# string:
# Find the leftmost digit, 1 \le d \le 9. Depending on its value, duplicate the
# substring of length d on the right side of the digit. After this, delete the
# digit from the string.
# For example, for the string 82silisko, the operations proceed as follows:
# 82silisko \rightarrow 2silisko2silisko \rightarrow sisilisko2silisko
# \rightarrow sisiliskosisilisko
# Find what the string will be after the operations. You can assume that the
# string eventually only contains letters.
# Input
# The only line of the input is a string consisting of characters a–z
# and 1–9.
# Each digit d is followed by at least d more characters.
# Output
# Output the string after the operations.
# Example 1
# Input:
# 82silisko

# Output:
# sisiliskosisilisko
# Example 2
# Input:
# mis3si1pi

# Output:
# mississippi


# let's brute force
s = input()

res = []
digits = True
while(digits):
    for i, c in enumerate(s):
        if (c.isdigit()):
            t = s[i + 1: ( i + 1 + int(c))]
            res.append(s[:i])
            s = t + s[i + 1:]
            digits = True
            break
        digits = False

print(''.join(res) + s)

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 1, 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED