add closest_to_n_and_divisble_by_m

Author: james5635

Logic Building/Find the number closest to n and divisible by m/1.py

@@ -0,0 +1,24 @@
+""" Iterative Checking """
+
+def closest_number(n:int,m:int) -> int:
+    """
+    <<< closest_number(10, 3)
+    9
+    <<< closest_number(10, 5)
+    10
+    <<< closest_number(15674.246)
+    15675
+    """
+    closest = 0
+    min_diff = float('inf')
+
+    for i in range(n-abs(m), n+abs(m)+1):
+        if i % m == 0:
+            diff = abs(n - i)
+            if diff < min_diff or (diff == min_diff and abs(i) >  abs(closest)):
+                closest = i
+                min_diff = diff
+    return closest
+if __name__ == "__main__":
+    from doctest import testmod
+    testmod(verbose=True)

Logic Building/Find the number closest to n and divisible by m/2.py

@@ -0,0 +1,32 @@
+""" By finding Quotient """
+
+def closest_number(n:int, m:int ) -> int:
+    """
+    <<< closest_number(10, 3)
+    10
+    <<< closest_number(10222, 5)
+    10220
+    <<< closest_number(152123123, 3213)
+    152123121
+    <<< closest_number(22234, 342)
+    22236
+    """
+    # Find the quotient
+    # q = n // m
+    q = int (n / m)
+
+    # First possible closest number
+    n1 = m * q
+
+    # Second possible closest number
+    if n * m > 0:
+        n2 = m * (q + 1)
+    else:
+        n2 = m * (q - 1)
+
+    if abs(n - n1) < abs(n - n2):
+        return n1
+    return n2
+if __name__ == "__main__":
+    from doctest import testmod
+    testmod(verbose=True)

Logic Building/Find the number closest to n and divisible by m/README.md

@@ -0,0 +1,3 @@
+## closest_to_n_and_divisble_by_m Method
+- Iterative Checking
+- By finding Quotient