Compare commits
No commits in common. "512b05f62453453194dbf0e7c40730cc337e85cb" and "cdfecf821ce57490df05088b30ff566d694ea0e0" have entirely different histories.
512b05f624
...
cdfecf821c
201
20/Cargo.lock
generated
201
20/Cargo.lock
generated
@ -1,201 +0,0 @@
|
||||
# This file is automatically @generated by Cargo.
|
||||
# It is not intended for manual editing.
|
||||
version = 3
|
||||
|
||||
[[package]]
|
||||
name = "aho-corasick"
|
||||
version = "1.1.2"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "b2969dcb958b36655471fc61f7e416fa76033bdd4bfed0678d8fee1e2d07a1f0"
|
||||
dependencies = [
|
||||
"memchr",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "autocfg"
|
||||
version = "1.1.0"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "d468802bab17cbc0cc575e9b053f41e72aa36bfa6b7f55e3529ffa43161b97fa"
|
||||
|
||||
[[package]]
|
||||
name = "day20"
|
||||
version = "0.1.0"
|
||||
dependencies = [
|
||||
"lazy-regex",
|
||||
"num",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "lazy-regex"
|
||||
version = "3.1.0"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "5d12be4595afdf58bd19e4a9f4e24187da2a66700786ff660a418e9059937a4c"
|
||||
dependencies = [
|
||||
"lazy-regex-proc_macros",
|
||||
"once_cell",
|
||||
"regex",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "lazy-regex-proc_macros"
|
||||
version = "3.1.0"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "44bcd58e6c97a7fcbaffcdc95728b393b8d98933bfadad49ed4097845b57ef0b"
|
||||
dependencies = [
|
||||
"proc-macro2",
|
||||
"quote",
|
||||
"regex",
|
||||
"syn",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "memchr"
|
||||
version = "2.6.4"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "f665ee40bc4a3c5590afb1e9677db74a508659dfd71e126420da8274909a0167"
|
||||
|
||||
[[package]]
|
||||
name = "num"
|
||||
version = "0.4.1"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "b05180d69e3da0e530ba2a1dae5110317e49e3b7f3d41be227dc5f92e49ee7af"
|
||||
dependencies = [
|
||||
"num-bigint",
|
||||
"num-complex",
|
||||
"num-integer",
|
||||
"num-iter",
|
||||
"num-rational",
|
||||
"num-traits",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "num-bigint"
|
||||
version = "0.4.4"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "608e7659b5c3d7cba262d894801b9ec9d00de989e8a82bd4bef91d08da45cdc0"
|
||||
dependencies = [
|
||||
"autocfg",
|
||||
"num-integer",
|
||||
"num-traits",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "num-complex"
|
||||
version = "0.4.4"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "1ba157ca0885411de85d6ca030ba7e2a83a28636056c7c699b07c8b6f7383214"
|
||||
dependencies = [
|
||||
"num-traits",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "num-integer"
|
||||
version = "0.1.45"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "225d3389fb3509a24c93f5c29eb6bde2586b98d9f016636dff58d7c6f7569cd9"
|
||||
dependencies = [
|
||||
"autocfg",
|
||||
"num-traits",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "num-iter"
|
||||
version = "0.1.43"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "7d03e6c028c5dc5cac6e2dec0efda81fc887605bb3d884578bb6d6bf7514e252"
|
||||
dependencies = [
|
||||
"autocfg",
|
||||
"num-integer",
|
||||
"num-traits",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "num-rational"
|
||||
version = "0.4.1"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "0638a1c9d0a3c0914158145bc76cff373a75a627e6ecbfb71cbe6f453a5a19b0"
|
||||
dependencies = [
|
||||
"autocfg",
|
||||
"num-bigint",
|
||||
"num-integer",
|
||||
"num-traits",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "num-traits"
|
||||
version = "0.2.17"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "39e3200413f237f41ab11ad6d161bc7239c84dcb631773ccd7de3dfe4b5c267c"
|
||||
dependencies = [
|
||||
"autocfg",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "once_cell"
|
||||
version = "1.19.0"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "3fdb12b2476b595f9358c5161aa467c2438859caa136dec86c26fdd2efe17b92"
|
||||
|
||||
[[package]]
|
||||
name = "proc-macro2"
|
||||
version = "1.0.70"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "39278fbbf5fb4f646ce651690877f89d1c5811a3d4acb27700c1cb3cdb78fd3b"
|
||||
dependencies = [
|
||||
"unicode-ident",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "quote"
|
||||
version = "1.0.33"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "5267fca4496028628a95160fc423a33e8b2e6af8a5302579e322e4b520293cae"
|
||||
dependencies = [
|
||||
"proc-macro2",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "regex"
|
||||
version = "1.10.2"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "380b951a9c5e80ddfd6136919eef32310721aa4aacd4889a8d39124b026ab343"
|
||||
dependencies = [
|
||||
"aho-corasick",
|
||||
"memchr",
|
||||
"regex-automata",
|
||||
"regex-syntax",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "regex-automata"
|
||||
version = "0.4.3"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "5f804c7828047e88b2d32e2d7fe5a105da8ee3264f01902f796c8e067dc2483f"
|
||||
dependencies = [
|
||||
"aho-corasick",
|
||||
"memchr",
|
||||
"regex-syntax",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "regex-syntax"
|
||||
version = "0.8.2"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "c08c74e62047bb2de4ff487b251e4a92e24f48745648451635cec7d591162d9f"
|
||||
|
||||
[[package]]
|
||||
name = "syn"
|
||||
version = "2.0.41"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "44c8b28c477cc3bf0e7966561e3460130e1255f7a1cf71931075f1c5e7a7e269"
|
||||
dependencies = [
|
||||
"proc-macro2",
|
||||
"quote",
|
||||
"unicode-ident",
|
||||
]
|
||||
|
||||
[[package]]
|
||||
name = "unicode-ident"
|
||||
version = "1.0.12"
|
||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||
checksum = "3354b9ac3fae1ff6755cb6db53683adb661634f67557942dea4facebec0fee4b"
|
||||
@ -1,10 +0,0 @@
|
||||
[package]
|
||||
name = "day20"
|
||||
version = "0.1.0"
|
||||
edition = "2021"
|
||||
|
||||
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
|
||||
|
||||
[dependencies]
|
||||
lazy-regex = "3.1.0"
|
||||
num = "0.4.1"
|
||||
58
20/input
58
20/input
@ -1,58 +0,0 @@
|
||||
%hm -> cr
|
||||
%qc -> nd
|
||||
&dh -> rm
|
||||
%ph -> zz
|
||||
%ps -> kc, dt
|
||||
%qb -> dt
|
||||
%jl -> vt, tb
|
||||
%fh -> dm, gr
|
||||
broadcaster -> np, mg, vd, xr
|
||||
%zz -> sq
|
||||
&rm -> rx
|
||||
%nd -> br
|
||||
%nx -> vr, vt
|
||||
%qf -> dt, dv
|
||||
%np -> xm, ph
|
||||
%dm -> nf, gr
|
||||
%sq -> kj
|
||||
%bv -> fp, xm
|
||||
%br -> kt
|
||||
%mg -> dz, gr
|
||||
&dt -> vd, dv, dh, hm, ks, hd, kq
|
||||
%ks -> qf
|
||||
&qd -> rm
|
||||
%xr -> vt, rn
|
||||
%vr -> tg, vt
|
||||
%lc -> xm
|
||||
%tq -> gr, fh
|
||||
%cr -> kq, dt
|
||||
%vd -> dt, ks
|
||||
%tb -> nx
|
||||
%dz -> gr, fd
|
||||
&gr -> dp, mg, fd, qn
|
||||
%nf -> gr
|
||||
%dv -> hm
|
||||
%qj -> lc, xm
|
||||
%kc -> dt, gf
|
||||
%gf -> dt, qb
|
||||
%vh -> xm, sv
|
||||
%sr -> vt
|
||||
%fp -> qg, xm
|
||||
%kj -> vh
|
||||
%pc -> tq, gr
|
||||
%kq -> hd
|
||||
%xd -> xg, gr
|
||||
%tg -> sr, vt
|
||||
&bb -> rm
|
||||
%rn -> vt, qc
|
||||
%hd -> ps
|
||||
%qg -> xm, qj
|
||||
&dp -> rm
|
||||
%qn -> pc
|
||||
%kt -> jl
|
||||
%sv -> bv
|
||||
&vt -> bb, nd, qc, xr, br, tb, kt
|
||||
%fd -> mx
|
||||
&xm -> zz, sv, sq, ph, kj, np, qd
|
||||
%xg -> gr, qn
|
||||
%mx -> gr, xd
|
||||
362
20/src/main.rs
362
20/src/main.rs
@ -1,362 +0,0 @@
|
||||
use std::collections::{BinaryHeap, HashMap, VecDeque};
|
||||
use std::fmt::Display;
|
||||
use std::fs::File;
|
||||
use std::hash::{Hash, Hasher};
|
||||
use std::io::{BufRead, BufReader, Lines};
|
||||
use std::time::Instant;
|
||||
|
||||
use lazy_regex::lazy_regex;
|
||||
use num::integer::lcm;
|
||||
|
||||
// BOILERPLATE
|
||||
type InputIter = Lines<BufReader<File>>;
|
||||
|
||||
fn get_input() -> InputIter {
|
||||
let f = File::open("input").unwrap();
|
||||
let br = BufReader::new(f);
|
||||
br.lines()
|
||||
}
|
||||
|
||||
fn main() {
|
||||
let start = Instant::now();
|
||||
let ans1 = problem1(get_input());
|
||||
let duration = start.elapsed();
|
||||
println!("Problem 1 solution: {} [{}s]", ans1, duration.as_secs_f64());
|
||||
|
||||
let start = Instant::now();
|
||||
let ans2 = problem2(get_input());
|
||||
let duration = start.elapsed();
|
||||
println!("Problem 2 solution: {} [{}s]", ans2, duration.as_secs_f64());
|
||||
}
|
||||
|
||||
// PARSE
|
||||
|
||||
const MODULE_PATTERN: lazy_regex::Lazy<lazy_regex::Regex> = lazy_regex!("^([%&]?)([a-z]+) -> ([a-z, ]+)$");
|
||||
|
||||
#[derive(Debug, PartialEq, Eq, Clone, Copy, Hash)]
|
||||
enum PulseType {
|
||||
Low,
|
||||
High,
|
||||
}
|
||||
|
||||
impl From<bool> for PulseType {
|
||||
fn from(value: bool) -> Self {
|
||||
match value {
|
||||
true => PulseType::High,
|
||||
false => PulseType::Low,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl From<PulseType> for bool {
|
||||
fn from(value: PulseType) -> Self {
|
||||
match value {
|
||||
PulseType::High => true,
|
||||
PulseType::Low => false,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl Display for PulseType {
|
||||
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
|
||||
match self {
|
||||
PulseType::Low => f.write_str("low"),
|
||||
PulseType::High => f.write_str("high"),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Clone, Copy)]
|
||||
enum ModuleKind {
|
||||
FlipFlop,
|
||||
Conjunction,
|
||||
Broadcast,
|
||||
Button,
|
||||
}
|
||||
|
||||
#[derive(Debug, Clone)]
|
||||
struct Module {
|
||||
name: String,
|
||||
kind: Option<ModuleKind>,
|
||||
inputs: Vec<String>,
|
||||
outputs: Vec<String>,
|
||||
on: bool,
|
||||
last_input_states: Vec<PulseType>,
|
||||
}
|
||||
|
||||
impl Hash for Module {
|
||||
fn hash<H: Hasher>(&self, state: &mut H) {
|
||||
// the only states that change are 'on' and 'last_input_states', the rest are constant once created
|
||||
self.on.hash(state);
|
||||
self.last_input_states.hash(state);
|
||||
}
|
||||
}
|
||||
|
||||
impl Module {
|
||||
fn new(name: String) -> Self {
|
||||
Self {
|
||||
name,
|
||||
kind: None,
|
||||
inputs: Vec::new(),
|
||||
outputs: Vec::new(),
|
||||
on: false,
|
||||
last_input_states: Vec::new(),
|
||||
}
|
||||
}
|
||||
fn source_idx(&self, name: &str) -> usize {
|
||||
self.inputs.iter().position(|in_name| in_name == name).unwrap()
|
||||
}
|
||||
fn with_kind(name: String, kind: ModuleKind) -> Self {
|
||||
let mut m = Self::new(name);
|
||||
m.kind = Some(kind);
|
||||
m
|
||||
}
|
||||
fn and_destinations(mut self, destinations: &str) -> Self {
|
||||
for dest in destinations.split(", ") {
|
||||
self.outputs.push(dest.into());
|
||||
}
|
||||
self
|
||||
}
|
||||
fn and_source(mut self, source: String) -> Self {
|
||||
self.add_source(source);
|
||||
self
|
||||
}
|
||||
fn add_source(&mut self, source: String) {
|
||||
self.inputs.push(source);
|
||||
self.last_input_states.push(PulseType::Low);
|
||||
}
|
||||
fn reset(&mut self) {
|
||||
// relevant state is on and last_input_states
|
||||
self.on = false;
|
||||
for input in &mut self.last_input_states {
|
||||
*input = PulseType::Low;
|
||||
}
|
||||
}
|
||||
fn state_space(&self) -> u128 {
|
||||
match self.kind {
|
||||
Some(ModuleKind::Broadcast) | Some(ModuleKind::Button) => 1,
|
||||
Some(ModuleKind::FlipFlop) => 2,
|
||||
Some(ModuleKind::Conjunction) => 1 << self.last_input_states.len(), // 2^n
|
||||
None => 1
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl From<&str> for Module {
|
||||
fn from(s: &str) -> Self {
|
||||
let Some(re_result) = MODULE_PATTERN.captures(s) else {
|
||||
panic!("unparseable module: {}", s);
|
||||
};
|
||||
let (_, [kind, name, destinations]) = re_result.extract();
|
||||
if name == "broadcaster" {
|
||||
return Module::with_kind(name.into(), ModuleKind::Broadcast).and_destinations(destinations);
|
||||
};
|
||||
match kind {
|
||||
"%" => Module::with_kind(name.into(), ModuleKind::FlipFlop).and_destinations(destinations),
|
||||
"&" => Module::with_kind(name.into(), ModuleKind::Conjunction).and_destinations(destinations),
|
||||
_ => panic!("invalid module kind {}", kind),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug)]
|
||||
struct Job {
|
||||
signal: PulseType,
|
||||
targets: Vec<String>,
|
||||
from: String,
|
||||
priority: usize,
|
||||
}
|
||||
|
||||
impl PartialEq for Job {
|
||||
fn eq(&self, other: &Self) -> bool {
|
||||
self.priority == other.priority
|
||||
}
|
||||
}
|
||||
impl Eq for Job {}
|
||||
|
||||
impl PartialOrd for Job {
|
||||
fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
|
||||
other.priority.partial_cmp(&self.priority)
|
||||
}
|
||||
}
|
||||
|
||||
impl Ord for Job {
|
||||
fn cmp(&self, other: &Self) -> std::cmp::Ordering {
|
||||
self.partial_cmp(other).unwrap()
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug)]
|
||||
struct Machine {
|
||||
modules: HashMap<String, Module>,
|
||||
work_queue: BinaryHeap<Job>,
|
||||
count_low: u64,
|
||||
count_high: u64,
|
||||
}
|
||||
|
||||
impl<T: BufRead> From<Lines<T>> for Machine {
|
||||
fn from(mut lines: Lines<T>) -> Self {
|
||||
let mut modules = HashMap::from([(
|
||||
"button".into(),
|
||||
Module::with_kind("button".into(), ModuleKind::Button).and_destinations("broadcaster"),
|
||||
)]);
|
||||
while let Some(Ok(line)) = lines.next() {
|
||||
let mut module = Module::from(line.as_str());
|
||||
for output in &module.outputs {
|
||||
if let Some(output_mod) = modules.get_mut(output) {
|
||||
// already exists, push to input list
|
||||
output_mod.add_source(module.name.to_owned());
|
||||
} else {
|
||||
// forward declaration of 'unknown' modules
|
||||
modules.insert(
|
||||
output.clone(),
|
||||
Module::new(output.clone()).and_source(module.name.clone()),
|
||||
);
|
||||
}
|
||||
}
|
||||
if let Some(existing_mod) = modules.get(&module.name) {
|
||||
module.inputs = existing_mod.inputs.clone(); // might have been pre-prepared, the rest we take ours
|
||||
module.last_input_states = existing_mod.last_input_states.clone();
|
||||
}
|
||||
modules.insert(module.name.clone(), module);
|
||||
}
|
||||
|
||||
Machine {
|
||||
modules,
|
||||
work_queue: BinaryHeap::new(),
|
||||
count_low: 0,
|
||||
count_high: 0,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl Machine {
|
||||
fn press_button(&mut self) {
|
||||
self.send_pulse(PulseType::Low, "broadcaster", "button", 1);
|
||||
}
|
||||
fn send_pulse(&mut self, signal: PulseType, target: &str, from: &str, priority: usize) {
|
||||
// count pulse when it is received
|
||||
match signal {
|
||||
PulseType::Low => self.count_low += 1,
|
||||
PulseType::High => self.count_high += 1,
|
||||
};
|
||||
match self.modules[target].kind {
|
||||
Some(ModuleKind::Button) | Some(ModuleKind::Broadcast) => {
|
||||
self.send_all_outputs(PulseType::Low, target, priority)
|
||||
}
|
||||
Some(ModuleKind::FlipFlop) => match signal {
|
||||
PulseType::High => (),
|
||||
PulseType::Low => {
|
||||
let new_state = !self.modules.get_mut(target).unwrap().on;
|
||||
self.modules.get_mut(target).unwrap().on = new_state;
|
||||
self.send_all_outputs(new_state.into(), target, priority)
|
||||
}
|
||||
},
|
||||
Some(ModuleKind::Conjunction) => {
|
||||
let target_m = self.modules.get_mut(target).unwrap();
|
||||
let source_idx = target_m.source_idx(from);
|
||||
target_m.last_input_states[source_idx] = signal;
|
||||
if target_m.last_input_states.iter().all(|state| *state == PulseType::High) {
|
||||
self.send_all_outputs(PulseType::Low, target, priority)
|
||||
} else {
|
||||
self.send_all_outputs(PulseType::High, target, priority)
|
||||
}
|
||||
}
|
||||
None => (),
|
||||
}
|
||||
}
|
||||
fn send_all_outputs(&mut self, signal: PulseType, from: &str, priority: usize) {
|
||||
self.work_queue.push(Job {
|
||||
signal,
|
||||
targets: self.modules[from].outputs.iter().map(|op| op.to_owned()).collect(),
|
||||
from: from.to_owned(),
|
||||
priority: priority + 1,
|
||||
})
|
||||
}
|
||||
fn run(&mut self) {
|
||||
while let Some(job) = self.work_queue.pop() {
|
||||
for target in job.targets {
|
||||
self.send_pulse(job.signal, &target, &job.from, job.priority);
|
||||
}
|
||||
}
|
||||
}
|
||||
// the number of cycles it took until the target sends a low pulse, or None if the target node sent no low pulses but the job finished
|
||||
fn time_to_state(&mut self, goal:&str, state: PulseType) -> Option<u64> {
|
||||
while let Some(job) = self.work_queue.pop() {
|
||||
if job.from == goal && job.signal == state {
|
||||
return Some(self.count_high + self.count_low);
|
||||
}
|
||||
for target in job.targets {
|
||||
self.send_pulse(job.signal, &target, &job.from, job.priority);
|
||||
}
|
||||
}
|
||||
None
|
||||
}
|
||||
fn reset(&mut self) {
|
||||
for (_name, m) in &mut self.modules {
|
||||
m.reset();
|
||||
}
|
||||
self.count_low = 0;
|
||||
self.count_high = 0;
|
||||
}
|
||||
fn state_space(&self) -> u128 {
|
||||
self.modules.values().map(|m| m.state_space()).product()
|
||||
}
|
||||
}
|
||||
|
||||
// PROBLEM 1 solution
|
||||
const PROBLEM1_ITERATIONS: usize = 1000;
|
||||
fn problem1<T: BufRead>(input: Lines<T>) -> u64 {
|
||||
let mut machine = Machine::from(input);
|
||||
for _ in 0..PROBLEM1_ITERATIONS {
|
||||
machine.press_button();
|
||||
machine.run();
|
||||
}
|
||||
machine.count_low * machine.count_high
|
||||
}
|
||||
|
||||
// PROBLEM 2 solution
|
||||
fn problem2<T: BufRead>(input: Lines<T>) -> u128 {
|
||||
let mut machine = Machine::from(input);
|
||||
println!("STATES: {}", machine.state_space());
|
||||
// Find the rx module and look at its parent(s)
|
||||
let rx = &machine.modules["rx"];
|
||||
// my input has a single conjunction as parent, todo implement other possibilities
|
||||
let con = &machine.modules[&rx.inputs[0]];
|
||||
|
||||
// for each input, find how long it takes for it to be High, so the conjunction sends a low to rx
|
||||
let mut cycles: Vec<_> = Vec::new();
|
||||
for input in con.inputs.clone() {
|
||||
print!("searching distance to {}...", input);
|
||||
machine.reset();
|
||||
let mut button_count = 0;
|
||||
loop {
|
||||
machine.press_button();
|
||||
button_count += 1;
|
||||
if let Some(distance) = machine.time_to_state(&input, PulseType::High) {
|
||||
println!("got {} pulses, {} button presses", distance, button_count);
|
||||
cycles.push(button_count as u128);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
cycles.iter().fold(1, |accum, cycle| lcm(accum, *cycle))
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use crate::*;
|
||||
use std::io::Cursor;
|
||||
|
||||
const EXAMPLE: &str = &"broadcaster -> a
|
||||
%a -> inv, con
|
||||
&inv -> b
|
||||
%b -> con
|
||||
&con -> output";
|
||||
|
||||
#[test]
|
||||
fn problem1_example() {
|
||||
let c = Cursor::new(EXAMPLE);
|
||||
assert_eq!(problem1(c.lines()), 11687500);
|
||||
}
|
||||
}
|
||||
Loading…
Reference in New Issue
Block a user