i love computers, science, math and understanding the world around us. https://maheshbansod.com
![Rust code:
```
impl<'a> Solver<'a> {
fn new(patterns: Vec<&'a str>) -> Self {
Self {
patterns,
cache: HashMap::new(),
}
}
fn solve(&mut self, design: &'a str) -> usize {
if design.is_empty() {
return 1;
}
self.cache.get(design).copied().unwrap_or_else(|| {
let mut total_count = 0;
for p in self
.patterns
.iter()
.filter(|&p| design.starts_with(*p))
.map(|p| p.to_string())
.collect::<Vec<_>>()
{
let count = self.solve(&design[p.len()..]);
total_count += count;
}
self.cache.insert(design, total_count);
total_count
})
}
}
```](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:n65ta65tifzludm7o553dkqn/bafkreiaxunfslzndd4w7rvltiwcjnzabreaxcjsxpsgnipdmr5ew53ugpq)
![Rust code snippet:
```rust
let mut best_a_value = 0;
let mut good_ending_a_values = vec![best_a_value];
while let Some(fixed_c) = good_ending_a_values.pop() {
for a in 0..8u64 {
let a_value = (fixed_c << 3) | a;
let mut runner =
Runner::new(&[a_value, registers[1].1, registers[2].1], program.clone());
runner.run();
let output = runner.output;
if output.len() <= program.len()
&& output
.iter()
.rev()
.enumerate()
.all(|(i, x)| *x as u8 == program[program.len() - i - 1])
{
best_a_value = a_value;
good_ending_a_values.push(a_value)
}
}
}
println!("this? {best_a_value}");
```](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:n65ta65tifzludm7o553dkqn/bafkreiccg3igf2fbn5k7qv4sprmtp4jrlxno46astvrfjgxintfm2u7jqa)
i love computers, science, math and understanding the world around us. https://maheshbansod.com