Merge branch 'geekcomputers:master' into testing

Author: NitkarshChourasia

Hand-Motion-Detection/requirements.txt

@@ -1,3 +1,3 @@
 numpy==1.25.2
 opencv_python==4.8.0.76
-mediapipe==0.10.3
+mediapipe==0.10.5

PDF/requirements.txt

@@ -1,2 +1,2 @@
-Pillow==10.0.0
+Pillow==10.0.1
 fpdf==1.7.2

Sum of digits of a number.py

@@ -1,13 +1,33 @@
-q=0   # Initially we assigned 0 to "q", to use this variable for the summation purpose below.
-    # The "q" value should be declared before using it(mandatory). And this value can be changed later.
+# Python code to calculate the sum of digits of a number, by taking number input from user.
 
-n=int(input("Enter Number: "))   # asking user for input
-while n>0:         # Until "n" is greater than 0, execute the loop. This means that until all the digits of "n" got extracted.
+import sys
 
-   r=n%10           # Here, we are extracting each digit from "n" starting from one's place to ten's and hundred's... so on.
+def get_integer():
+    for i in range(3,0,-1):                       # executes the loop 3 times. Giving 3 chances to the user.
+        num = input("enter a number:")
+        if num.isnumeric():                       # checks if entered input is an integer string or not.
+            num = int(num)                        # converting integer string to integer. And returns it to where function is called.
+            return num
+        else:
+            print("enter integer only")                    
+            print(f'{i-1} chances are left' if (i-1)>1 else f'{i-1} chance is left')     # prints if user entered wrong input and chances left.
+        continue   
+        
 
-   q=q+r            # Each extracted number is being added to "q".
+def addition(num):
+    Sum=0
+    if type(num) is type(None):               # Checks if number type is none or not. If type is none program exits.
+        print("Try again!")
+        sys.exit()
+    while num > 0:                            # Addition- adding the digits in the number.
+        digit = int(num % 10)
+        Sum += digit
+        num /= 10
+    return Sum                                # Returns sum to where the function is called.
 
-   n=n//10          # "n" value is being changed in every iteration. Dividing with 10 gives exact digits in that number, reducing one digit in every iteration from one's place.
 
-print("Sum of digits is: "+str(q))
+
+if __name__ == '__main__':                    # this is used to overcome the problems while importing this file.                         
+    number = get_integer()
+    Sum = addition(number)
+    print(f'Sum of digits of {number} is {Sum}')      # Prints the sum

bodymass.py

@@ -0,0 +1,19 @@
+kilo = float (input("kilonuzu giriniz(örnek: 84.9): "))
+boy = float (input("Boyunuzu m cinsinden giriniz: "))
+
+vki = (kilo / (boy**2))
+
+if vki < 18.5:
+    print(f"vucut kitle indeksiniz:  {vki} zayıfsınız.")
+elif vki < 25:
+    print (f"vucut kitle indeksiniz: {vki} normalsiniz.")
+elif vki < 30:
+    print (f"vucut kitle indeksiniz: {vki} fazla kilolusunuz.")
+elif vki < 35:
+    print (f"vucut kitle indeksiniz: {vki} 1. derece obezsiniz")
+elif vki < 40:
+    print (f"vucut kitle indeksiniz: {vki} 2.derece obezsiniz.")
+elif vki >40:
+    print (f"vucut kitle indeksiniz: {vki} 3.derece obezsiniz.")
+else:
+    print("Yanlış değer girdiniz.")

power_of_n.py

@@ -0,0 +1,58 @@
+# Assign values to author and version.
+__author__ = "Himanshu Gupta"
+__version__ = "1.0.0"
+__date__ = "2023-09-03"
+
+def binaryExponentiation(x: float, n: int) -> float:
+    """
+    Function to calculate x raised to the power n (i.e., x^n) where x is a float number and n is an integer and it will return float value
+
+    Example 1:
+
+    Input: x = 2.00000, n = 10
+    Output: 1024.0
+    Example 2:
+
+    Input: x = 2.10000, n = 3
+    Output: 9.261000000000001
+
+    Example 3:
+
+    Input: x = 2.00000, n = -2
+    Output: 0.25
+    Explanation: 2^-2 = 1/(2^2) = 1/4 = 0.25
+    """
+
+    if n == 0:
+        return 1
+
+    # Handle case where, n < 0.
+    if n < 0:
+        n = -1 * n
+        x = 1.0 / x
+
+    # Perform Binary Exponentiation.
+    result = 1
+    while n != 0:
+        # If 'n' is odd we multiply result with 'x' and reduce 'n' by '1'.
+        if n % 2 == 1:
+            result *= x
+            n -= 1
+        # We square 'x' and reduce 'n' by half, x^n => (x^2)^(n/2).
+        x *= x
+        n //= 2
+    return result
+
+
+if __name__ == "__main__":
+    print(f"Author: {__author__}")
+    print(f"Version: {__version__}")
+    print(f"Function Documentation: {binaryExponentiation.__doc__}")
+    print(f"Date: {__date__}")
+    
+    print() # Blank Line
+
+    print(binaryExponentiation(2.00000, 10))
+    print(binaryExponentiation(2.10000, 3))
+    print(binaryExponentiation(2.00000, -2))
+