matura_2016_zadanie_1

gistfile1.txt

#zadanie 1.1
def divider (number):
	result=[]
	for i in range (1, number-1):
		if (number%i)==0:
            		result.append(i)
    	return result

def areAssociated(pairOfNumbers):
	if (sum(divider(pairOfNumbers[0]))==pairOfNumbers[1]+1)and(sum(divider(pairOfNumbers[1]))==(pairOfNumbers[0]+1)):
		return 'TAK'
 	else:
		return 'NIE'
        
    
numbers=[[20, 21], [75, 48]]
resultsTable=[]

for i in range(len(numbers)):
	resultsTable=[numbers[i][0],numbers[i][1], divider(numbers[i][0]), divider(numbers[i][1]), sum(divider(numbers[i][0])), sum(divider(numbers[i][1])), areAssociated(numbers[i])]
	print(resultsTable)


#zadanie 1.2    
yourNumber=int(input('gimme your number(a>1): '))
assert yourNumber>1, 'Number needs to be greater than 1' 
potentialAssociatedNumber=sum(divider(yourNumber))-1
t=[yourNumber, potentialAssociatedNumber]
if areAssociated(t)=='TAK':
	print(potentialAssociatedNumber)
else:
	print('NIE')

Bardzo dobry kod 👍