Ositus

string = input()
n = len(string)-1

viivat = [0 for i in range(n)]
tavat = []

def line(n, viivat, tavat):
    for i in range(2):
        viivat[n] = i
        if viivat not in tavat:
            tavat.append(viivat.copy())
        if n > 0:
            line(n-1, viivat, tavat)

line(n-1, viivat, tavat)
total = 0
for item in tavat:
    cut = 0
    result = []
    for i in range(len(item)):
        if item[i] == 1:
            result.append(string[cut:i+1])
            cut = i+1
    result.append(string[cut:])

    status = True
    for partition in result:
        for ch in partition:
            if partition.count(ch) > 1:
                status = False
                break
    if status == True:
        total += 1

print(total)

Test 1

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 15, in <module>
    line(n-1, viivat, tavat)
  File "input/code.py", line 9, in line
    viivat[n] = i
IndexError: list assignment index out of range

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: TIME LIMIT EXCEEDED

Test 6

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 15, in <module>
    line(n-1, viivat, tavat)
  File "input/code.py", line 13, in line
    line(n-1, viivat, tavat)
  File "input/code.py", line 13, in line
    line(n-1, viivat, tavat)
  File "input/code.py", line 13, in line
    line(n-1, viivat, tavat)
  [Previous line repeated 994 more times]
  File "input/code.py", line 8, in line
    for i in range(2):
RecursionError: maximum recursion depth exceeded in comparison

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED