Solve task

src/task26 - Reciprocal cycles.py

@@ -1,4 +1,16 @@
 
-for i in range(1,1000):
+
-    x = 1/i
+numsWithRecurringCycles = [n for n in range(2,1000) if n % 2 != 0 and n % 5 != 0]
-    
+
+def digits(num, divisor):
+  x = num
+  storedSums = []
+  while not x*10 in storedSums:
+    x *= 10
+    storedSums.append(x)
+    x %= divisor
+  return len(storedSums)
+
+digitNumList = [digits(1, n) for n in numsWithRecurringCycles]
+
+print(numsWithRecurringCycles[digitNumList.index(max(digitNumList))])