|
|
|
|
@ -22,7 +22,9 @@ impl Solver for Day0
|
|
|
|
|
|
|
|
|
|
fn solve(&mut self, _input: String) -> Result<u64, String>
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
let fibs = gen_fib_seq(50, std::i64::MAX / 2);
|
|
|
|
|
println!("fib nums:");
|
|
|
|
|
print_fibs(fibs);
|
|
|
|
|
Ok(0)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
@ -38,4 +40,38 @@ impl Day0
|
|
|
|
|
{
|
|
|
|
|
Day0 {}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Helpers
|
|
|
|
|
/// stop_after: the number of fib values to generate
|
|
|
|
|
/// max_val: the maximum fib value to generate. Forces the function to
|
|
|
|
|
/// return even if stop_after is not met.
|
|
|
|
|
fn gen_fib_seq(stop_after: i32, max_val: i64) -> Vec<i64>
|
|
|
|
|
{
|
|
|
|
|
let mut a: i64 = 1;
|
|
|
|
|
let mut b: i64 = 1;
|
|
|
|
|
let mut nums: Vec<i64> = vec![];
|
|
|
|
|
nums.push(a);
|
|
|
|
|
for _ in 0..stop_after -1
|
|
|
|
|
{
|
|
|
|
|
nums.push(b);
|
|
|
|
|
let t = b;
|
|
|
|
|
b = a + b;
|
|
|
|
|
a = t;
|
|
|
|
|
|
|
|
|
|
if b >= max_val
|
|
|
|
|
{
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
nums
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn print_fibs(fibs: Vec<i64>)
|
|
|
|
|
{
|
|
|
|
|
for (i, f) in fibs.iter().enumerate()
|
|
|
|
|
{
|
|
|
|
|
println!("{}: {}", i + 1, f);
|
|
|
|
|
}
|
|
|
|
|
}
|