Upload Lesson 12.

Author: Mickey0521

12-Gcd_cckao.pdf

@@ -0,0 +1,19 @@
+# you can write to stdout for debugging purposes, e.g.
+# print("this is a debug message")
+
+def solution(N, M):
+    # write your code in Python 3.6
+    
+    # key:
+    # meet in the circle = number of chocolates that you will eat
+    #  number of chocolates = N / gcd(N, M)
+    num_chocolates = N // gcd(N,M)
+    
+    return num_chocolates
+
+# find gcd (greatest common divisor)
+def gcd(a, b):
+    if a % b == 0:
+        return b
+    else:
+        return gcd(b, a%b)

ChocolatesByNumbers_high_performance.py

@@ -0,0 +1,16 @@
+# you can write to stdout for debugging purposes, e.g.
+# print("this is a debug message")
+
+def solution(N, M):
+    # write your code in Python 3.6
+    
+    my_dictionary = {}
+    
+    current_value = 0 
+    
+    while current_value not in my_dictionary:
+        my_dictionary[current_value] = 1 
+        current_value = (current_value + M) % N 
+    # print(my_dictionary)
+    
+    return len(my_dictionary)