fix ruffs

Author: indigo0445

project_euler/problem_108/sol1.py

@@ -47,14 +47,14 @@ def find_prime_factorizations(limit: int) -> list[dict[int, int]]:
     [{}, {}, {2: 1}, {3: 1}, {2: 2}, {5: 1}, {2: 1, 3: 1}, {7: 1}]
     """
     primes = find_primes(limit)
-    prime_factorizations = [{} for _ in range(limit + 1)]
+    prime_factorizations : list[dict[int, int]] = [{} for _ in range(limit + 1)]
 
     for p in primes:
         for j in range(p, limit + 1, p):
             j_factorization = prime_factorizations[j]
             x = j
             while x % p == 0:
-                x /= p
+                x //= p
                 j_factorization[p] = j_factorization.get(p, 0) + 1
     return prime_factorizations
 
@@ -86,6 +86,8 @@ def solution(target: int = 1000) -> int:
         num_solutions = (num_divisors_of_square(prime_factorizations[i]) // 2) + 1
         if num_solutions > target:
             return i
+    
+    return -1
 
 
 if __name__ == "__main__":