Fix various type errors

rust/src/p0001.rs

@@ -22,5 +22,5 @@ pub fn p0001() -> i128 {
     for i in (0..1000).step_by(15) {
         answer -= i;
     }
-    return answer;
+    return answer.into();
 }

rust/src/p0002.rs

@@ -24,5 +24,5 @@ pub fn p0002() -> i128 {
         i = j;
         j = tmp;
     }
-    return answer;
+    return answer.into();
 }

rust/src/p0003.rs

@@ -12,5 +12,8 @@ What is the largest prime factor of the number 600851475143 ?
 use crate::primes::prime_factors;
 
 pub fn p0003() -> i128 {
-    return prime_factors::<u64>(600851475143).max().expect("This number has prime factors");
+    return prime_factors::<u64>(600851475143)
+        .max()
+        .expect("This number has prime factors")
+        .into();
 }

rust/src/p0004.rs

@@ -14,19 +14,19 @@ Find the largest palindrome made from the product of two 3-digit numbers.
 */
 use itertools::Itertools;
 
-fn is_palindrome(x: u64) -> bool {
+fn is_palindrome(x: u32) -> bool {
     let s = x.to_string();
     return s == s.chars().rev().collect::<String>();
 }
 
 pub fn p0004() -> i128 {
     let mut answer: u32 = 0;
     for v in (100..1000).combinations(2) {
-        let p = v.into_iter().product();
+        let p: u32 = v.into_iter().product();
         if is_palindrome(p) && p > answer {
             answer = p;
         }
     }
-    return answer;
+    return answer.into();
 }
 

rust/src/p0005.rs

@@ -26,5 +26,5 @@ pub fn p0005() -> i128 {
             }
         }
     }
-    return answer;
+    return answer.into();
 }

rust/src/p0006.rs

@@ -24,5 +24,5 @@ pub fn p0006() -> i128 {
     let sum_of_squares = group.clone().fold(0, |x, y| x + y * y);
     let sum: u32 = group.sum();
     let square_of_sum = sum * sum;
-    return square_of_sum - sum_of_squares;
+    return (square_of_sum - sum_of_squares).into();
 }

rust/src/p0007.rs

@@ -12,5 +12,9 @@ What is the 10 001st prime number?
 use crate::primes::primes;
 
 pub fn p0007() -> i128 {
-    return primes::<u32>().take(10001).last().unwrap();
+    return primes::<u32>()
+        .take(10001)
+        .last()
+        .unwrap()
+        .into();
 }

rust/src/p0008.rs

@@ -69,5 +69,5 @@ pub fn p0008() -> i128 {
             answer = prod;
         }
     }
-    return answer;
+    return answer.into();
 }

rust/src/p0009.rs

@@ -23,7 +23,7 @@ pub fn p0009() -> i128 {
             for a in 1..b {
                 let a_square = a * a;
                 if a_square + b_square == c_square && a + b + c == 1000 {
-                    return a * b * c;
+                    return (a * b * c).into();
                 }
             }
         }

rust/src/p0010.rs

@@ -13,5 +13,8 @@ Find the sum of all the primes below two million.
 use crate::primes::primes;
 
 pub fn p0010() -> i128 {
-    return primes::<u64>().take_while(|&p| p < 2000000).sum();
+    return primes::<u64>()
+        .take_while(|&p| p < 2000000)
+        .sum()
+        .into();
 }