add Dice Method

Author: james5635

Logic Building/Check whether a given number is even or odd/1.py

@@ -2,9 +2,9 @@
 
 def isEven(n: int) -> bool:
     """
-    <<< isEven(10)
+    >>> isEven(10)
     true
-    <<< isEven(11)
+    >>> isEven(11)
     false
     """
     return n % 2 == 0

Logic Building/Check whether a given number is even or odd/README.md

@@ -1,4 +1,4 @@
-## Check Even/Odd
+## Check_Even/Odd Method
 - By Finding the Remainder 
 - Using Bitwise AND Operator 
 - Using Bitwise Shift Operators 

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

@@ -2,11 +2,11 @@
 
 def closest_number(n:int,m:int) -> int:
     """
-    <<< closest_number(10, 3)
+    >>> closest_number(10, 3)
     9
-    <<< closest_number(10, 5)
+    >>> closest_number(10, 5)
     10
-    <<< closest_number(15674.246)
+    >>> closest_number(15674.246)
     15675
     """
     closest = 0

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

@@ -2,13 +2,13 @@
 
 def closest_number(n:int, m:int ) -> int:
     """
-    <<< closest_number(10, 3)
+    >>> closest_number(10, 3)
     10
-    <<< closest_number(10222, 5)
+    >>> closest_number(10222, 5)
     10220
-    <<< closest_number(152123123, 3213)
+    >>> closest_number(152123123, 3213)
     152123121
-    <<< closest_number(22234, 342)
+    >>> closest_number(22234, 342)
     22236
     """
     # Find the quotient

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

@@ -1,3 +1,3 @@
-## Closest number 
+## Closest_to_n_and_divisible_by_m Method
 - Iterative Checking
 - By finding Quotient

Logic Building/Program for Sum of squares of first n natural numbers/README.md

@@ -1,2 +1,2 @@
-## Sum of square of natural
+## Sum_of_square_of_natural_number Method
 - Adding One By One (Overflow, Not_Overflow)

Logic Building/Program to find sum of first n natural numbers/README.md

@@ -1,2 +1,2 @@
-## Sum of natural
+## Sum_of_natural_number Method
 - Loop Based Summation (Overflow, Not_Overflow)

Logic Building/Program to print multiplication table of a number/README.md

@@ -1,3 +1,3 @@
-## Multiplication Table
+## Multiplication_Table Method
 - Iterative Approach 
 - Recursive Approach

Logic Building/Swap Two Numbers/README.md

@@ -1,4 +1,4 @@
-## Swap two numbers
+## Swap_two_numbers Method
 - Using third variable
 - Without using third variable (arithmetic, bitwise)
 - Built-in swap

Logic Building/The dice problem/1.py

@@ -0,0 +1,25 @@
+""" Using if-else statement """
+def opposite_face(n):
+    """
+    >>> opposite_face(1) 
+    6
+    >>> opposite_face(2) 
+    5
+    >>> opposite_face(3) 
+    4
+    """
+    if n == 1:
+        return 6
+    elif n == 2:
+        return 5
+    elif n == 3:
+        return 4
+    elif n == 4:
+        return 3
+    elif n == 5:
+        return 2
+    elif n == 6:
+        return 1
+if __name__ == "__main__":
+    from doctest import testmod
+    testmod()