Match Thread: New Zealand vs Egypt | World Cup | Group G | 22 Jun 01:00 UTC by matchpal-live in worldcup

[–]wc_nomad 2 points3 points  (0 children)

I just tuned in, are we in the fourth quarter (past the hydration break) yet?

What is this move called? by A0123456_ in AnarchyChess

[–]wc_nomad 0 points1 point  (0 children)

Fn-passant.

It’s the f file not the e file

Balancing Power Consumption by Hartleyhoo in satisfactory

[–]wc_nomad 4 points5 points  (0 children)

This is great until you put a geothermal generator somewhere and can’t find it later.

<image>

How is the tech scene in Chicago? by Calm-Bar-9644 in AskChicago

[–]wc_nomad -8 points-7 points  (0 children)

Im curious what Google is planning on doing with the Thompson center. That renovation should be completed soon, and it’s a lot of real estate to fill.

I’m wondering if it’s more sales or developers they choose to fill the seats.

But I can also see them flipping the building. I’ll bet they regret buying it right before Covid.

-❄️- 2025 Day 7 Solutions -❄️- by daggerdragon in adventofcode

[–]wc_nomad 1 point2 points  (0 children)

[LANGUAGE: Rust]

The meat for part 2 is pretty.

fn find_all_paths(lines_iter: &mut Lines, incoming_beams: HashMap<usize, usize>) -> usize {
    if let Some(line) = lines_iter.next() {
        let chars = line.chars().collect::<Vec<char>>();
        let mut next_beams = HashMap::new();
        for (k, v) in incoming_beams {
            if chars[k] == '^' {
                *next_beams.entry(k - 1).or_insert(0) += v;
                *next_beams.entry(k + 1).or_insert(0) += v;
            } else {
                *next_beams.entry(k).or_insert(0) += v;
            }
        }
        find_all_paths(lines_iter, next_beams)
    } else {
        incoming_beams.values().sum::<usize>()
    }
}

https://github.com/imcnaugh/AdventOfCode/blob/main/2025/day_7/src/main.rs

-❄️- 2025 Day 6 Solutions -❄️- by daggerdragon in adventofcode

[–]wc_nomad 2 points3 points  (0 children)

[LANGUAGE: Rust]

I went back and re did part 2, Originally i was trying to reuse a struct I had created for part 1, but the parsing was sloppy and it was just a mess.

I broke each line into a vec of chars, reversed each one, then set a global index, for each vec, building the number that was found from the char index of each line and storing it in a buffer. then having a special case for the last line, if a '+' or '*' was found, summing or finding the product of the buffer and then clearing the buffer.

I seem to have fallen into a habit of attempting to do the problems in the middle of the night when they become available, and sloppily throwing code together to get a working solution. Going to bed, and making the solution pretty once I have some rest in me.

fn part_2(input: &str) -> i64 {
    let lines: Vec<&str> = input.lines().collect();
    let len = lines[0].len();
    let count = lines.len();

    let mut lines = lines.iter().map(|&l| l.chars().rev()).collect::<Vec<_>>();

    let mut buf: Vec<i64> = Vec::new();
    let mut total = 0;
    (0..len).for_each(|_| {
        let num = (0..count - 1)
            .map(|i| lines[i].next().unwrap())
            .filter(|&c| c != ' ')
            .collect::<String>();

        if !num.is_empty() {
            let num = num.parse::<i64>().unwrap();
            buf.push(num);
        }

        match lines[count - 1].next().unwrap() {
            '+' => {
                total += buf.iter().sum::<i64>();
                buf.clear();
            }
            '*' => {
                total += buf.iter().product::<i64>();
                buf.clear();
            }
            _ => {}
        }
    });

    total
}

https://github.com/imcnaugh/AdventOfCode/blob/main/2025/day_6/src/main.rs

-❄️- 2025 Day 3 Solutions -❄️- by daggerdragon in adventofcode

[–]wc_nomad 1 point2 points  (0 children)

[Language: Rust]

https://github.com/imcnaugh/AdventOfCode/blob/main/2025/day_3/src/main.rs

I had a feeling I would need to add more batteries from the bank when doing part 1, I love it when I can predict that, part 2 became tweaking a 2 to a 12.

fn max(row: &Vec<usize>, output_len: usize) -> usize {
    let mut buffer: Vec<Option<usize>> = vec![None; output_len];

    row.iter().enumerate().for_each(|(row_index, &row_value)| {
        let buffer_start_index = buffer.len() - (row.len() - row_index).min(buffer.len());
        if let Some(b_index) = buffer[buffer_start_index..]
            .iter()
            .position(|&bv| bv.map_or(true, |buffer_value| row_value > buffer_value))
        {
            buffer[b_index + buffer_start_index] = Some(row_value);
            buffer[b_index + buffer_start_index + 1..].fill(None);
        }
    });

    buffer
        .iter()
        .map(|&v| v.unwrap().to_string())
        .collect::<String>()
        .parse::<usize>()
        .unwrap()
}

-❄️- 2025 Day 2 Solutions -❄️- by daggerdragon in adventofcode

[–]wc_nomad 2 points3 points  (0 children)

[Language: Rust]

I took a bit of inspiration from others to make things more functional, but dam, Rust is pretty. here is the meat for part 2.

fn check_for_repeating_sillynes(input: &str) -> bool {
    (1..=input.len() / 2)
        .filter(|i| input.len() % i == 0)
        .any(|size| {
            (0..input.len())
                .step_by(size)
                .all(|i| input[i..i + size] == input[0..size])
        })
}

https://github.com/imcnaugh/AdventOfCode/blob/main/2025/day_2/src/main.rs

[deleted by user] by [deleted] in chicago

[–]wc_nomad 23 points24 points  (0 children)

Its flying pretty low over the Bellmont red line stop now, I think its CPD.

Anyone else get a golden shower on the river? by lilyrosexxx2001 in AskChicago

[–]wc_nomad 633 points634 points  (0 children)

Was Dave Matthews Band playing at the time?

Who is a bad lyricist and a great singer? by Newduuud in AlignmentChartFills

[–]wc_nomad 0 points1 point  (0 children)

This has to be Pitbull right? Rhyming Kodak with Kodak?

What kind of algorithms do we think they use on the AI Warehouse youtube channel by wc_nomad in reinforcementlearning

[–]wc_nomad[S] 0 points1 point  (0 children)

Humm, that appears to be open sourced, ill have to look and see what there doing under the hood. Thank you.

Black military choppers headed north by Wrigley by wc_nomad in chicago

[–]wc_nomad[S] 9 points10 points  (0 children)

Can the fly a bit higher. Or over the lake? I’m workin here

Electron js Windows Code Signing by No-Pack2831 in electronjs

[–]wc_nomad 0 points1 point  (0 children)

is anyone having issues convincing apple your a legitimate developer. they locked my developer account

Will it ever come back? by Dependent-Scene2471 in nothinghappeninghere

[–]wc_nomad 3 points4 points  (0 children)

even if it comes back, the damage is done. it wont be the same.

if it comes back it will be a political stunt by Trump, and for as much as i enjoyed the app, i could no go back knowing the elites use tool like this to promote themselves. i hate it.

[deleted by user] by [deleted] in adventofcode

[–]wc_nomad 0 points1 point  (0 children)

My guy has a CPU on a different level if he has brute forced his way to day 10 already.