#------------------------TD3------------------------#


#####################[Code 1]##########################

n = int(input("Number: "))

i = 1
while i <= n:
    print(i)
    i = i + 1



#####################[Code 2]##########################

n = int(input("Number: "))

for i in range(1, n+1):
    print(i)



#####################[Code 3]##########################

for i in range(0, 101):
    if i % 5 == 0 and i % 3 != 0:
        print(i)



#####################[Code 4]##########################

count = 0
x = 1
while count < 20:
    if x%5 == 0 and x%7 == 0 and x%11 == 0:
        print(x)
        count += 1
    x += 1



#####################[Code 5]##########################

A = [38, 56, 12, 62, 23, 41]
    
min = A[0]

for i in range(0, len(A)):
    if A[i] < min:
        min = A[i]

print("Minimum is: ", min)



#####################[Code 6]##########################

A = [38, 56, 12, 62, 23, 41]
    
min = A[0]

for x in A:
    if x < min:
        min = x

print("Minimum is: ", min)



#####################[Code 7]##########################

x = 1
keep_searching = True
while keep_searching:
    if (x%1==0 and x%2==0 and x%3==0 and x%4==0 and x%5==0 and
        x%6==0 and x%7==0 and x%8==0 and x%9==0 and x%10==0):
        print(x)
        keep_searching = False
    x += 1



#####################[Code 8]##########################

x = 0
keep_searching = True
while keep_searching:
    x += 1
    keep_searching = False
    for i in range(1, 11):
        if x%i != 0 :
            keep_searching = True
print(x)



#####################[Code 9]##########################

A = [52, 73, 134, 1, 13, 62, 77, 123, 4, 40, 43, 87]

for i in range(0, len(A)):
    for j in range(i+1, len(A)):
        if ( (A[i] + A[j]) == 14) or ( (A[i]+A[j]) == 44):
            print(A[i], A[j])



#####################[Code 10]##########################

A = [0, 52, 73, 134, 1, 13, 62, 77, 123, 4, 40, 43, 87, 2, 15]

for i in range(0, len(A)):
    for j in range(i+1, len(A)):
        for k in range(j+1, len(A)):
            if ( (A[i] + A[j] + A[k] == 14) or
                 (A[i] + A[j] + A[k] == 44) ):
                print(A[i], A[j], A[k])



#####################[Code 11]##########################

for i in range(0, 16):
    for j in range(i+1, 16):
        for k in range(j+1, 16):
            if (i+j+k) == 15:
                print(i, j, k)



#####################[Code 12]##########################

h = int(input("Enter height: "))
w = int(input("Enter width: "))

for i in range(0, h):
    for j in range(0, i):
       print(" ", end='')

    for j in range(0, w):
        print("*", end='')

    print()



#####################[Code 13]##########################

w = int(input("Enter w: "))
h = int(input("Enter h: "))


for i in range(0, h):
    print(" "*i, "*"*w, sep='')



#####################[Code 14]##########################

n = int(input("Enter a number : "))

divisors = []

for i in range(1, n+1):
    if (n % i) == 0:
        divisors.append(i)

print(divisors)



#####################[Code 15]##########################

n = int(input("Enter a number : "))

divisors = []

for i in range(1, n):
    if (n % i) == 0:
        divisors.append(i)

sum = 0
for x in divisors:
    sum = sum + x

if (n < sum):
    print(n, "is an abundant number.")
elif (n == sum):
    print(n, "is a perfect number.")
else:
    print(n, "is a deficient number.")



#####################[Code 16]##########################

n = int(input("Enter a number : "))

sum = 0
for i in range(1, n):
    if (n % i) == 0:
        sum = sum + i

if (n < sum):
    print(n, "is an abundant number.")
elif (n == sum):
    print(n, "is a perfect number.")
else:
    print(n, "!is a deficient number.")



#####################[Code 17]##########################

A = [3,6,2,5,11,7,1]

minindex = 0
maxindex = 0

for i in range(0, len(A)):
    if A[i] > A[maxindex]:
        maxindex = i
    if A[i] < A[minindex]:
        minindex = i

print("A: ", A)
print(maxindex, minindex)



#####################[Code 18]##########################

A = [1,7,-3,6,-9,2]

maxv, maxi, maxj = A[0], 0, 0

for i in range(0, len(A)):
    _sum = 0
    for j in range(i, len(A)):
        _sum += A[j]
        if _sum > maxv:
            maxv = _sum
            maxi = i
            maxj = j

print("i: ", maxi, " j: ", maxj, " with sum: ", maxv)