@@ -0,0 +1,1060 @@
+from string import ascii_lowercase as AL%0Afrom math import ceil%0A%0Adef moving_shift(s, shift, decode = False):%0A%0A    result = ''%0A    %0A    for i,j in enumerate(''.join(s)):%0A        if j.isalpha():%0A            index = AL.index(j.lower())%0A            %0A            if decode:%0A                nidx    = (index-shift-i)%0A                current = nidx if nidx %3E 0 else nidx if abs(nidx) %3C 26 else (abs(nidx) %25 26 * -1)%0A            elif not decode:%0A                nidx    = (index+shift+i)%0A                current = nidx if nidx %3C 26 else nidx %25 26%0A                %0A            result += AL%5Bcurrent%5D.upper() if j.isupper() else AL%5Bcurrent%5D%0A        else: result += j%0A        %0A    if decode: return ''.join(result)    %0A    %0A    part = int(len(s)/5 if len(s)%255==0 else ceil(len(s)/5.0))%0A    %0A    final = %5B%5D%0A    for i in range(0, len(s), part):%0A        try:    final.append(result%5Bi:i+part%5D)%0A        except: final.append(result%5Bi+part:%5D)%0A        %0A    return final if len(final) == 5 else final + %5B''%5D   %0A%0Adef demoving_shift(s, shift):%0A    return moving_shift(s, shift, True)%0A

Create first_variation_on_caesar_cipher.py