i dont even know anymore
This commit is contained in:
parent
bc361d191a
commit
20f2212595
2 changed files with 22508 additions and 116886 deletions
139377
2024/day4/part1/output.txt
139377
2024/day4/part1/output.txt
File diff suppressed because one or more lines are too long
|
@ -34,22 +34,23 @@ fn main() {
|
||||||
|
|
||||||
for y in 1..leny {
|
for y in 1..leny {
|
||||||
let widthup = y >= 4;
|
let widthup = y >= 4;
|
||||||
let widthdown = (leny - y) > 3;
|
let widthdown = (leny - y) >= 4;
|
||||||
|
|
||||||
for x in 1..lenx+1 {
|
for x in 1..lenx+1 {
|
||||||
// check if enough space left and right
|
// 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;
|
let widthleft = x >= 4;
|
||||||
println!("width left: {}", widthleft);
|
|
||||||
let widthright = (lenx - x) > 3;
|
let widthright = (lenx - x) >= 4;
|
||||||
println!("width right: {}", widthright);
|
|
||||||
|
|
||||||
// search algorithm starts here
|
// search algorithm starts here
|
||||||
// check if the char is s
|
// check if the char is s
|
||||||
if frfrvec[y][x] == 'X' {
|
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
|
// check if going upwards
|
||||||
if widthup {
|
if widthup {
|
||||||
if frfrvec[y - 1][x] == 'M'
|
if frfrvec[y - 1][x] == 'M'
|
||||||
|
|
Loading…
Reference in a new issue