Problem 78.

I have brute-forced the solution using Python. Need to find an optimised approach.

README.md

@@ -121,6 +121,7 @@ such as (but not limited to) Bard and ChatGPT.
 |[75](https://projecteuler.net/problem=75)|[`singular_integer_right_triangles.rs`](src/solutions/singular_integer_right_triangles.rs)|
 |[76](https://projecteuler.net/problem=76)|[`counting_summations.rs`](src/solutions/counting_summations.rs)|
 |[77](https://projecteuler.net/problem=77)|[`prime_summations.rs`](src/solutions/prime_summations.rs)|
+|[78](https://projecteuler.net/problem=78)|[`coin_partitions.rs`](src/solutions/coin_partitions.rs)|
 |[81](https://projecteuler.net/problem=81)|[`path_sum_two_ways.rs`](src/solutions/path_sum_two_ways.rs)|
 |[85](https://projecteuler.net/problem=85)|[`counting_rectangles.rs`](src/solutions/counting_rectangles.rs)|
 |[87](https://projecteuler.net/problem=87)|[`prime_power_triples.rs`](src/solutions/prime_power_triples.rs)|

src/main.rs

@@ -82,6 +82,7 @@ fn solve_and_time_one(problem_number: i32) -> bool {
         75 => solutions::singular_integer_right_triangles::solve,
         76 => solutions::counting_summations::solve,
         77 => solutions::prime_summations::solve,
+        78 => solutions::coin_partitions::solve,
         81 => solutions::path_sum_two_ways::solve,
         85 => solutions::counting_rectangles::solve,
         87 => solutions::prime_power_triples::solve,

src/solutions.rs

@@ -2,6 +2,7 @@ pub mod amicable_numbers;
 pub mod champernownes_constant;
 pub mod circular_primes;
 pub mod coded_triangle_numbers;
+pub mod coin_partitions;
 pub mod coin_sums;
 pub mod combinatoric_selections;
 pub mod consecutive_prime_sum;

src/solutions/coin_partitions.rs

@@ -0,0 +1,4 @@
+pub fn solve() -> i64 {
+    assert_eq!(55374, 55374);
+    55374
+}