Update count-the-number-of-ideal-arrays.py

Python/count-the-number-of-ideal-arrays.py

@@ -37,7 +37,7 @@ def linear_sieve_of_eratosthenes(n):  # Time: O(n), Space: O(n)
         def prime_factors(x):
             factors = collections.Counter()
             for p in primes:
-                if x < p:
+                if p*p > x:
                     break
                 while x%p == 0:
                     factors[p] += 1