Patterns LAB-22 AUG-2
Tue Aug 22 2023 06:17:21 GMT+0000 (Coordinated Universal Time)
Saved by @Astik
def func1(n): sum=0 while(n>0): rem=n%10 n=n%10 sum=sum+rem print("Sum is : ",sum) def func2(n): rev=n%10 while(n>0): n=n/10 rem=n%10 rev= 10*rev+rem print("Reverse number is:") return rev def func3(n): if(func(2)==n): print("Number is palindrome.") else: print("Number is not palindrome.") def func4(n): max=0 while(n>0): num=n%10 n=n/10 if(max<num): max=num print("Max digit is : ",max) def func5(n): min=10 while(n>0): num=n%10 n=n/10 if(min>num): min=num print("Min digit is : ",min) def func6(n): number = str(n) number = ''.join(sorted(number)) number = int(number) print(number) def func7(n): dig=0 sum=0 while(n>0): dig=n%10 sum= sum+(dig**3) if(sum==n): print("The number is Armstrong number.") else: print("The number is not Armstrong number") def func8(n): max=0 prev=0 while(n>0): num=n%10 n=n/10 if(max<num): prev=max max=num print("Second Max digit is : ",prev) def func9(n): min=10 prev=0 while(n>0): num=n%10 n=n/10 if(min>num): prev=min min=num print("Second Min digit is : ",min) def func10(n): swapped = 0 swapped = n%10 t=reverse(n) t=t//10 while t>0: swapped = swapped*10 +(t%10) t=t//10 swapped=swapped//10 swapped=swapped*10 +(reverse(n)%10) return swapped choice=1 n= eval(input("Enter the number: ")) print("1. Sum of digit \n2. Reverse number \n3. Palindrome \n4. Max Digit \n5. Min digit \n6. Sort the digits \n7. Armstrong number \n8. Second max digit \n9.Second min digit \n10.Swap first and last digit") ch=eval(input("Enter your choice: ")) while(choice==1): if(ch==1): func1(n) elif(ch==2): func2(n) elif(ch==3): func3(n) elif(ch==4): func4(n) elif(ch==5): func5(n) elif(ch==6): func6(n) elif(ch==7): func7(n) elif(ch==8): func8(n) elif(ch==9): func9(n) elif(ch==10): func10(n) else: print("Wrong choice.") choice= eval(input("DO you want to continue(1 for YES 0 for NO): ")) (**********************************************************************************************************************************************************************************) def func1(n): sum=0 while(n>0): rem=n%10 n=n//10 sum=sum+rem print("Sum is : ",sum) def func2(n): rev=n%10 while(n>10): n=n//10 rem=n%10 rev= 10*rev+rem print("Reverse number is:",rev) return rev def func3(n): if(func2(n)==n): print("Number is palindrome.") else: print("Number is not palindrome.") def func4(n): max=0 while(n>0): num=n%10 n=n//10 if(max<num): max=num print("Max digit is : ",max) def func5(n): min=10 while(n>0): num=n%10 n=n//10 if(min>num): min=num print("Min digit is : ",min) def func6(n): number = str(n) number = ''.join(sorted(number)) number = int(number) print(number) def func7(n): dig=0 sum=0 while(n>0): dig=n%10 n=n//10 sum= sum+(dig**3) if(sum==n): print("The number is Armstrong number.") else: print("The number is not Armstrong number") def func8(n): max=0 prev=0 while(n>0): num=n%10 n=n//10 if(max<num): prev=max max=num # print("Second Max digit is : ",max) print("Second Max digit is : ",prev) def func9(n): min=10 prev=0 while(n>0): num=n%10 n=n//10 if(min>num): prev=min min=num print("Second Min digit is : ",prev) def func10(n): pass choice=1 n= eval(input("Enter the number: ")) print("1. Sum of digit \n2. Reverse number \n3. Palindrome \n4. Max Digit \n5. Min digit \n6. Sort the digits \n7. Armstrong number \n8. Second max digit \n9.Second min digit \n10.Swap first and last digit") while(choice==1): ch=eval(input("Enter your choice: ")) if(ch==1): func1(n) elif(ch==2): func2(n) elif(ch==3): func3(n) elif(ch==4): func4(n) elif(ch==5): func5(n) elif(ch==6): func6(n) elif(ch==7): func7(n) elif(ch==8): func8(n) elif(ch==9): func9(n) elif(ch==10): func10(n) else: print("Wrong choice.") choice=0
Comments