ACSL Senior Contest 1 [2019-20]

ACSL-SR1-1920.py

def prime(n):
    count = [];
    while n%2 == 0: 
        count.append(2)
        n = n/2
    for i in range(3,int(n**.5)+1,2): 
        while n%i == 0: 
            count.append (i) 
            n = n/i 
    if n>2: count.append(int(n))
    return(len(list(set(count))))

for i in range(5):
    n,p = input("Positive integer: "), input("Position: ")
    r = len(n)-int(p)
    f = ""
    for i in range(len(n)) :
        if (i<r): f+= str(int(n[i])+int(n[r]))
        elif (i>r): f+= str(abs(int(n[i])-int(n[r])))
        else: f+= str(prime(int(n)))

    print(f+"\n-------------------------")