primes_crypto.py

from collections import Counter
import string
import sys

def factores_primos(n):
    factor = 2
    while n >= 2:
        if n % factor:
            factor += 1
        else:
            n //= factor
            yield factor

numeros = [int(line.strip()) for line in sys.stdin.readlines()]
factorizaciones = [sorted(Counter(factores_primos(numero)).items()) for numero in numeros]
palabras = [''.join(string.ascii_lowercase[potencia - 1] for _primo, potencia in factorizacion)
            for factorizacion in factorizaciones]
print(palabras)

# $> python primes_crypto.py < ciphers.txt
# ['turing', 'dijstra', 'programa', 'desafio', 'algoritmo']