17_practice4_prime_perfect_rerewxp

import math
import re

# avg

# marks = [1, 2, 3, 4, 5]
# print('average: ', sum(marks)/len(marks))


# another avg
#------------------------

# marks1 = ' 2 50 80  '  # str
# removeSpace = re.sub(r"^\s+|\s+$", "", marks1, flags=re.UNICODE) # remove space from beginning & last
# marks1ToList = removeSpace.split(' ')  # convert it into list
# marks1ListToInt = list(map(int, marks1ToList))  # str list to int list
# fistIndex = marks1ListToInt[0]   # get the 1st index val
# total = sum(marks1ListToInt)     # sum of the list
# total = total - fistIndex     # subtract with 1st index
# # divide the total with 1st index to find out avg
# avg1 = '{:.2f}'.format(total / fistIndex)
# print('average: ', avg1)

# prime no
#----------------

# prime = [71, 99, 81, 5, 43, 29, 100, 51, 65, 22]
# count = []
# for i in prime:
#     isPrime = True
#     for j in range(2,i):
#         if i % j == 0:
#            isPrime = False
#     if isPrime:
#         count.append(i)
# print('total prime: ', len(count) )

# perfect no
#-------------------

num = [2, 3, 4, 6, 8, 28]
def divisors(x):
    return [i for i in range(1, x) if x % i == 0]

for i in num:
    if sum(divisors(i)) == i:
        print('perfect no: ', i)
    else:
        print('non perfect no: ', i)

# single perfect no
# --------------------

# for i in range(1,num):
#     if num % i == 0:
#         list.append(i)
# sumOfList = sum(list)
# if sumOfList == num:
#     print('perfect number..')
# else:
#     print('not perfect')