problem_solving_in_python

Author: Sagar Paul

01_Armstrong Numbers 1 to 1000.py

@@ -0,0 +1,29 @@
+for i in range(1001):
+    num = i
+    result = 0
+    n = len(str(i))
+    while (i !=0):
+        digit = i%10
+        result = result + digit**n
+        i = i//10
+    if num == result:
+        print(result)
+    
+
+'''
+
+
+n = int(input("Enter upto which digit you want to find Angstrom number:  "))
+
+for i in range(1,n+1):
+    l = len(str(i))
+    result = 0
+    a = str(i)
+    for j in range(l):
+        result = result + int(a[j])**l
+    if result == i:
+        print(i)
+    
+
+'''
+

02_Python Pattern Programs - Printing Numbers in Right Triangle Shape.py

@@ -0,0 +1,18 @@
+'''
+1
+1 2
+1 2 3
+1 2 3 4 
+1 2 3 4 5
+1 2 3 4 5 6
+
+'''
+n = 6
+for i in range(1,n+1):
+    for j in range(1,i+1):
+        print(j,end=" ")
+
+    print()
+
+
+

03_Printing Stars in Hollow Right Triangle Shape.py

@@ -0,0 +1,32 @@
+'''
+*
+**
+* *
+*  *
+*   *
+*    *
+*     *
+*      *
+*       *
+**********
+'''
+n = int(input("Write the number:"))
+print("*")
+print("**")
+for i in range(n-2):
+    print("*"," "*i, "*")
+print("*"*n)
+
+'''
+
+n = int(input("Enter row number:  "))
+for row in range(n+1):
+    for col in range(row+1):
+        if row ==n or col ==0 or col ==row:
+            print("*",end="")
+        else:
+            print(end=" ")
+    print()
+
+'''
+

04_Printing Hollow Right Triangle Star Pattern.py

@@ -0,0 +1,23 @@
+'''
+*
+**
+* *
+*  *
+*   *
+*    *
+*     *
+*      *
+*       *
+**********
+'''
+n = int(input("Write the number: \n"))
+
+for row in range(n+1):
+    for col in range(n+1):
+        if row ==n or col ==0 or row ==col:
+            print("*", end="")
+        else:
+            print(end=" ")
+    print()
+
+

05_ Factorial Program using In-Built Function.py

@@ -0,0 +1,9 @@
+import math
+n = int(input("Write the number here: \n"))
+
+print(f"Factorial of {n} is:  {math.factorial(n)}")
+
+
+
+
+

06_ Factorial using Recusion.py

@@ -0,0 +1,14 @@
+num = int(input(""))
+def recur_factorial(n):
+   if n == 1:
+       return n
+   else:
+       return n*recur_factorial(n-1)
+
+# check if the number is negative
+if num < 0:
+   print("Sorry, factorial does not exist for negative numbers")
+elif num == 0:
+   print("The factorial of 0 is 1")
+else:
+   print("The factorial of", num, "is", recur_factorial(num))

07_ Factorial using Recusion.py

@@ -0,0 +1,9 @@
+def fact(n):
+    if n ==0:
+        return 1
+    else:
+        return n*fact(n-1)
+    
+n = int(input("Write the number: \n"))
+print(f"Factorial of {n} is: {fact(n)}")
+

08_Factorial Program Using for loop.py

@@ -0,0 +1,6 @@
+n = int(input("Enter the number: \n"))
+fact = 1
+for i in range(1,n+1):    
+    fact = fact*i
+print(f"factorial of {n} is:  {fact}")
+

09_Printing Stars in Hollow Right Triangle Shape is Reverse order.py

@@ -0,0 +1,24 @@
+'''
+*********
+ *      *
+  *     *
+   *    *
+    *   *
+     *  *
+      * *
+       **
+        *
+
+'''
+n = int(input("type the number:   "))
+print("*"*n)
+for i in range(n,2,-1):
+    print(" "*(n-i),"*"," "*(i-3),"*")
+print(" "*(n-1),"*"*2)
+print(" "*n,"*")
+
+
+
+
+
+

10_Floyd's Triangle | Printing Numbers in Right Triangle Shape.py

@@ -0,0 +1,18 @@
+'''
+1
+2 3
+4 5 6
+7 8 9 10
+11 12 13 14 15
+
+'''
+
+n = int(input("type the number here: \n"))
+num = 1
+for row in range(1,n+1):
+    for col in range(1,row+1):
+        print(num, end=" ")
+        num = num +1
+    print()
+
+

11_Printing Strings in Right Triangle Shape.py

@@ -0,0 +1,8 @@
+word = "python"
+a = list(word)
+for row in range(len(a)+1):
+    for col in range(row+1):
+        print(a[col],end="")
+    print()
+
+

12_Fibonacci Series.py

@@ -0,0 +1,14 @@
+# Fibonacci Series 0,1,1,2,3,5,8,13,21,34
+
+n = int(input("Type how many numbers your want :  "))
+first = 0 
+second = 1
+
+for i in range(n):
+    print(first)
+    temp = first
+    first  = second
+    second = temp+second
+
+
+

13_Printing Numbers in Right Triangle Shape.py

@@ -0,0 +1,10 @@
+'''
+55555
+4444
+333
+22
+1
+'''
+
+for i in range(5,0,-1):
+    print(str(i)*i)

14_Numbers in Right Triangle Shape.py

@@ -0,0 +1,14 @@
+'''
+1 2 3 4 5 
+1 2 3 4 
+1 2 3 
+1 2 
+1 
+'''
+
+n = int(input("type the number:  "))
+for row in range(1,n+1):
+    for col in range(1,n+2-row):
+        print(col, end=" ")
+    print()
+

15_Program To Check Entered Number is Prime or Not.py

@@ -0,0 +1,17 @@
+# Program To Check Entered Number is Prime or Not
+
+n = int(input("input a number to check wheather it is prime or not:  "))
+if n>=1:
+    if n==1:
+        print("1 is NOT PRIME Number")
+    else:
+        for i in range(2,n):
+            if n%i ==0:
+                print(f"The number {n} is NOT a PRIME number")
+                break
+        else:
+            print(f"The number {n} is a PRIME number")
+else:
+    print(f"The number {n} is NOT a PRIME number")
+
+

16_Printing Prime Numbers in Given Interval.py

@@ -0,0 +1,16 @@
+n = int(input("type the number upto which you wanna find PRIME number:   "))
+a = []
+if n>1:
+    for  i in range(2,n+1):
+        for j in range(2,i):
+            if i%j ==0:
+                break
+        else:
+            a.append(i)
+    print(a)
+    
+            
+
+
+
+

17_Printing Stars in Hollow Equilateral Triangle Shape | Pyramid Pattern.py

@@ -0,0 +1,15 @@
+'''
+   *
+  * *
+ *   *
+*******
+'''
+n = int(input("Type how many rows you want:   "))
+for row in range(1,n+1):
+    for col in range(1,2*n):
+        if row ==n or col - row == n-1 or col + row == n+1 :
+            print("*", end="")
+        else:
+            print(end=" ")
+    print()
+

18_Printing Stars in Hollow Equilateral Triangle Shape | Pyramid Pattern.py

@@ -0,0 +1,20 @@
+'''
+   *
+  * *
+ *   *
+* * * *
+'''
+
+n = int(input("Type no. of rows: "))
+for row in range(1,n+1):
+    for col in range(1,2*n):
+        if row == n :
+            if col%2 !=0:
+                print("*",end="")
+            else:
+                print(end=" ")
+        elif row + col == n+1 or col -row == n-1 :
+            print("*",end="")
+        else:
+            print(end=" ")
+    print()

19_Perfect Numbers | Program to Check Entered Number is Perfect or Not.py

@@ -0,0 +1,19 @@
+# Perfect Numbers:  a number is called perfect number if the sum of all divisors of the number excluding that number 
+# Example:  6 = 1+ 2 + 3   ---> 6 is perfect number
+# 4 != 1 + 2   ---> 4 is not a perfect number
+
+n = int(input("Type the number: "))
+sum = 0
+for i in range(1,n):
+    if n%i ==0:
+        sum = i + sum
+    else:
+        None
+
+if sum == n:
+    print(f"the number {n} is PERFECT number")
+else:
+    print(f"the number {n} is NOT PERFECT number")
+    
+
+        

20_Program to Print Perfect Numbers in Given Interval.py

@@ -0,0 +1,15 @@
+#Program to Print Perfect Numbers in Given Interval
+
+upper = int(input("Type the upper number here:  "))
+lower = int(input("Type the lower number here:  "))
+
+print(f"The perfect numbers in range[{lower},{upper}] are : ")
+
+for num in range(lower, upper+1):
+    sum = 0
+    for j in range(1,num):
+        if num%j ==0:
+            sum = sum +j
+    if sum ==num :
+        print(num)
+    

21_To Swap Two Numbers With using third Variables.py

@@ -0,0 +1,12 @@
+a = int(input("a =  "))
+b  =int(input("b =  "))
+
+temp = a
+a = b
+b = temp
+
+print("After swaping values of a and b")
+
+print(f"a = {a}")
+print(f"b = {b}")
+

22_Swap Two Numbers Without Using Third Variable.py

@@ -0,0 +1,11 @@
+a = int(input("a =   "))
+b = int(input("b =  "))
+
+a = a+b
+b = a-b
+a = a -b
+
+print("After swaping ")
+print(f"a = {a}")
+print(f"b = {b}")
+

23_Printing Stars in Right Triangle Shape Using Nested While loop.py

@@ -0,0 +1,21 @@
+'''
+* 
+* * 
+* * * 
+* * * * 
+* * * * * 
+'''
+
+n = int(input("Enter number of rows:  "))
+
+row= 1
+while row<=n:
+    col = 1
+    while col<=row:
+        print(end="* ")
+        col = col +1
+    print()
+    row = row + 1
+
+
+