I noticed that power automate was lumped into the agents section. So mainly went with the disable 3rd party settings. Since you know, that's enabled by default like a bunch of other settings.

Technically it was just only recently that ms no longer has mainstream support for 32bit oses, as they only dropped that with windows 11.

Makes me think that might be the reason for valve choosing now to do this.

Honestly I expect someone to make custom cases for it. If valve don't release a model there will at least be someone doing a 3d printed model that fits the board.

You would kinda notice the disk usage. Last I saw it was quite image heavy and could use a fair amount if you had a lot of activity.

So is this the reason that I see massive full page ads saying that WhatsApp is secure? They are worried that introducing ai will make everyone worried it can read all the messages? Or is it that just that they now have a way to read your messages?

Iirc, if you use a non-linear scale, it comes out properly as his face.

That is just more propaganda. In the netflix program about it they show that they can't tell the difference.

The whole natural diamond thing is they want to control the volume of diamonds on the market. If you can make them, then there will be such a high production the prices will plummet. The only reason the price is high, is that they keep production low.

I've pointed out that this issue could arrise so many times to companies with the all staff email. Every time they push back on wanting to define limited senders, "we don't think it's an issue/no one would do that!" Until someone sends an inappropriate email to the whole company, then it's suddenly IT's fault.

That requires more circuitry. Just have the computer check every 0.25s, and if you have depressed the button it is a 1, else a 0.

Eff has a better list imo. Diceware has a tonne of short abbreviations like "1st". Eff is words that are mostly 5 to 8 characters long. Much more xkcd like and easier to make a mnemonic out of.

Mine does not have a rotating plate, just a glass bottom. I assume the magnetron rotates, either that or it heats unevenly.

I saw that coming, but decided to do it the naive way for part 1, then fixed that up for part 2. Thanks to AoC I can also recognise a Manhattan distance written in a complex manner.

import re
import math
import argparse
import itertools

def print_sky(sky:list):
    for r in sky:
        print("".join(r))

class Point:
    def __init__(self,x:int,y:int) -> None:
        self.x = x
        self.y = y

    def __repr__(self) -> str:
        return f"Point({self.x},{self.y})"

    def distance(self,point:Point):
        # Manhattan dist
        x = abs(self.x - point.x)
        y = abs(self.y - point.y)
        return x + y

def expand_galaxies(galaxies:list,position:int,amount:int,index:str):
    for g in galaxies:
        if getattr(g,index) > position:
            c = getattr(g,index)
            setattr(g,index, c + amount)

def main(line_list:list,part:int):
    ## list of lists is the plan for init idea

    expand_value = 2 -1
    if part == 2:
        expand_value = 1e6 -1
    if part > 2:
        expand_value = part -1

    sky = list()
    for l in line_list:
        row_data = [*l]
        sky.append(row_data)
    
    print_sky(sky)
    
    # get galaxies
    gal_list = list()
    for r in range(0,len(sky)):
        for c in range(0,len(sky[r])):
            if sky[r][c] == '#':
                gal_list.append(Point(r,c))

    print(gal_list)

    col_indexes = list(reversed(range(0,len(sky))))
    # expand rows
    for i in col_indexes:
        if not '#' in sky[i]:
            expand_galaxies(gal_list,i,expand_value,'x')

    # check for expanding columns
    for i in reversed( range(0, len( sky[0] )) ):
        col = [sky[x][i] for x in col_indexes]
        if not '#' in col:
            expand_galaxies(gal_list,i,expand_value,'y')

    print(gal_list)

    # find all unique pair distance sum, part 1
    sum = 0
    for i in range(0,len(gal_list)):
        for j in range(i+1,len(gal_list)):
            sum += gal_list[i].distance(gal_list[j])

    print(f"Sum distances: {sum}")

if __name__ == "__main__":
    parser = argparse.ArgumentParser(description="template for aoc solver")
    parser.add_argument("-input",type=str)
    parser.add_argument("-part",type=int)
    args = parser.parse_args()
    filename = args.input
    if filename == None:
        parser.print_help()
        exit(1)
    part = args.part
    file = open(filename,'r')
    main([line.rstrip('\n') for line in file.readlines()],part)
    file.close()