endernon/aoc-solutions
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

i dont even know anymore

Browse source
This commit is contained in:
endernon 2024-12-04 23:24:03 +00:00
parent bc361d191a
commit 20f2212595
2 changed files with 22508 additions and 116886 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

139377
2024/day4/part1/output.txt
View file

File diff suppressed because one or more lines are too long

17
2024/day4/part1/src/main.rs
View file

@ -34,22 +34,23 @@ fn main() {
for y in 1..leny {
let widthup = y >= 4;
let widthdown = (leny - y) > 3;
let widthdown = (leny - y) >= 4;
for x in 1..lenx+1 {
// check if enough space left and right
println!("x is {x}");
println!("y is {y}");
println!("width up: {}", widthup);
println!("width down: {}", widthdown);
let widthleft = x >= 4;
println!("width left: {}", widthleft);
let widthright = (lenx - x) > 3;
println!("width right: {}", widthright);
let widthright = (lenx - x) >= 4;
// search algorithm starts here
// check if the char is s
if frfrvec[y][x] == 'X' {
println!("x is {x}");
println!("y is {y}");
println!("width up: {}", widthup);
println!("width down: {}", widthdown);
println!("width left: {}", widthleft);
// check if going upwards
if widthup {
if frfrvec[y - 1][x] == 'M'