Ositus

# Datatahti 2022 alku
# Ositus (Partitioning)
# @author TRS
MOD = 1000000007
MX = 1000001
partitions = [0] * MX
def partitioning(s, start):
    if (len(s) <= 1):
        return 1
    answer = 0
    for i in range(0, len(s)):
        found = False
        for j in range(0, i):
            if (s[i] == s[j]):
                found = True
                break
        if (found):
            break
        if (partitions[start + i + 1] == 0):
            answer += partitioning(s[i + 1:], start + i + 1)
        else:
            answer += partitions[start + i + 1]
    answer %= MOD
    partitions[start] = answer
    return answer
s = input()
if (len(s) == 1):
    print(1)
else:
    print(partitioning(s, 0))

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 30, in <module>
    print(partitioning(s, 0))
  File "input/code.py", line 20, in partitioning
    answer += partitioning(s[i + 1:], start + i + 1)
  File "input/code.py", line 20, in partitioning
    answer += partitioning(s[i + 1:], start + i + 1)
  File "input/code.py", line 20, in partitioning
    answer += partitioning(s[i + 1:], start + i + 1)
  [Previous line repeated 994 more times]
  File "input/code.py", line 11, in partitioning
    for i in range(0, len(s)):
RecursionError: maximum recursion depth exceeded in comparison

Test 7

Group: 3

Verdict: RUNTIME ERROR