From 8dadaeef8ba7de1a21a57e38b03e48a98759b3d4 Mon Sep 17 00:00:00 2001
From: Muhammad Nauman Raza <devraza.hazard643@slmail.me>
Date: Tue, 3 Dec 2024 12:26:50 +0000
Subject: [PATCH] solutions: 50

---
 src/bin/consecutive_prime_sum.rs | 51 ++++++++++++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 src/bin/consecutive_prime_sum.rs

diff --git a/src/bin/consecutive_prime_sum.rs b/src/bin/consecutive_prime_sum.rs
new file mode 100644
index 0000000..43b4977
--- /dev/null
+++ b/src/bin/consecutive_prime_sum.rs
@@ -0,0 +1,51 @@
+fn check_prime(x: u32) -> bool {
+    let mut check = true;
+    for j in 2..=(x as u32).isqrt() {
+        if x % 2 == 0 {
+            check = false;
+        } else if x % j == 0 {
+            check = false;
+        }
+    }
+    check
+}
+
+fn consecutive_combinations<T: Clone>(vec: &[T]) -> Vec<Vec<T>> {
+    let mut combinations = Vec::new();
+    let len = vec.len();
+
+    for size in 1..=len {
+        for start in 0..=(len - size) {
+            let window = vec[start..start + size].to_vec();
+            combinations.push(window);
+        }
+    }
+
+    combinations
+}
+
+fn main() {
+    let mut primes: Vec<u32> = vec![];
+    for i in 2..10000 {
+        if check_prime(i) {
+            primes.push(i);
+        }
+    }
+
+    let mut maximum = 0;
+    let mut sum = 0;
+
+    let combinations = consecutive_combinations(&primes);
+
+    for combination in combinations {
+        let length = combination.len();
+        let local_sum: u32 = combination.iter().sum();
+
+        if check_prime(local_sum) && local_sum < 1000000 && length > maximum {
+            maximum = length;
+            sum = local_sum;
+        }
+    }
+
+    println!("{}", sum);
+}