Ositus

jono_o = input()
alphabet = "abcdefghijklmnopqrstuvxyz"
x = 0
def find_all(string, character):
    indexes = []
    for i, c in enumerate(string):
        if c == character:
            indexes.append(i)
    return indexes
for k in alphabet:
    jono = jono_o
    if jono.count(k)>1:
        ind = find_all(jono, k)
        p = 0
        for h in range(jono.count(k)-1):
            x += 2**(len(jono[:ind[h]])+len(jono[ind[h+1]+1:]))
varasto = ""
virheet = 0
taso = 1
jono = jono_o
hik = True
jik = True
olivirhe = False
while taso < 10:
    ensivirhe = -1
    while hik == True:
        for i, k in enumerate(jono[ensivirhe+1:], start=ensivirhe+1):
            if varasto.count(k)>=1:
                virheet += 1
                if virheet == 1:
                    ind = find_all(jono[:i], k)
                    ensivirhe = ind[-1]
            varasto = varasto + k
            if virheet > taso:
                x -= 2**(len(jono[:ensivirhe])+len(jono[i+1:]))
                if olivirhe == False:
                    olivirhe = True
                break
            if i == len(jono)-1:
                hik = False
        varasto = ""        
        virheet = 0
    hik = True
    if olivirhe == False:
        break
    olivirhe = False
    taso += 1
 
vastaus = 2**(len(jono_o)-1)-x
print(vastaus%(10**9+7))

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED