Refactor problem 35

src/Python/Problem035.py

@@ -31,11 +31,16 @@ def compute():
     """
     circular_primes = []
     for i in range(2, 1_000_000):
-        for j in circular_number(i):
-            if not is_prime(j):
-                break
-        else:
-            circular_primes.append(i)
+        if is_prime(i):
+            all_primes = True
+            for j in circular_number(i):
+                if not is_prime(j):
+                    all_primes = False
+                    break
+            # else:
+            #     circular_primes.append(i)
+            if all_primes:
+                circular_primes.append(i)
     
     return len(circular_primes)