bharathmuddada

l=[10,5,28,6,35,29]

def getSeclargest(l):
    if len(l)<= 1:
        return None
    lar=l[0]
    slar = None
    for x in l[1:]:
        if x > lar:
            slar =lar

bharathmuddada

l=[10,5,28,6,35]

def getmax(l):
    if not l:
        return None
    else:
        res =l[0]
        for i in range(1,len(l)):
            if l[i] > res:
                res =l[i]

bharathmuddada

l=[10,5,28,6,35]

def getmax(l):
    for i in l:
        for j in l:
            if j > i:
                break
        else:
            return i
    return None

bharathmuddada

def decToBinary(n):

    if n==0:
        return "0"
    res =""
    while n > 0:
        res = res + str(n%2)
        n = n//2
    return res[::-1]

bharathmuddada

n = int(input("Enter your number \n"))

if n <= 1:
    print("No")
else:
    for i in range(2, n):
        if n % i == 0:
            print("No")
            break
    else:

bharathmuddada

a =int(input("Enter your number \n"))
b =int(input("Enter your number \n"))

small = min(a,b)

for i in range(1,small+1):
    if (a%i ==0 and b% i ==0):
        gcd =i

print(gcd)

bharathmuddada

a = int(input("Enter your number \n"))
b = int(input("Enter your number \n"))

res = max(a, b)

while res <= a * b:
    if res % a == 0 and res % b == 0:
        break
    res += 1
print(res)

bharathmuddada

n = int(input("Enter your number"))

for i in range(n):
    for j in range(n):
        print('*',end="")
    print()

bharathmuddada

number = int(input("Enter your number \n"))

for i in range(2, number + 1):
    if number % i == 0:
        print(i, "is smallest divisor")
        break

bharathmuddada

number = int(input())


counter =0
while number > 0:
    number = number//10
    print(number)
    counter +=1
print("number of digits :",counter)