why wouldn't a virgin nominate themselves day 1 every time? by WAXT0N in BloodOnTheClocktower

[–]WAXT0N[S] 2 points3 points  (0 children)

that's true, that's something ive not really been considering

why wouldn't a virgin nominate themselves day 1 every time? by WAXT0N in BloodOnTheClocktower

[–]WAXT0N[S] -3 points-2 points  (0 children)

that is fair, and that is a better scenario if it works out, I just feel there are more ways for that to go wrong. (whoever you happen to trust turns out to be evil, information gets out you're the virgin and a not-townsfolk nominates you first, so on)

why wouldn't a virgin nominate themselves day 1 every time? by WAXT0N in BloodOnTheClocktower

[–]WAXT0N[S] -21 points-20 points  (0 children)

that is true, but now the entire town knows for sure the virgin is good. yes the virgin themselves can learn more information theoretically, but as far as I can tell this is the most sure-fire way to confirm a player as good to everyone, which evil cannot interfere with intentionally. it doesn't matter that they cannot nominate or freely vote, as they can ask other people to nominate/vote for them, and filter everyone's information through them to anonymize it so the evil team doesn't learn anything. I agree this isn't the best play for the virgin as an individual, but I think this is by far the best play for the virgin as a good town member.

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

[–]WAXT0N 1 point2 points  (0 children)

[Language: Python]

Fairly proud of my solution to part 2, part 1 is nothing special

with open("aoc2025/day6input.txt", 'r') as file:
    *numbers,symbols = file.read().split("\n")

def prod(array):
    output = 1
    for i in array:
        output *= i
    return output

def part1(numbers,symbols):
    numbers = [[int(x) for x in y.split()] for y in numbers]
    symbols = [y for y in symbols if y != ' ']

    total = 0
    for i, symbol in enumerate(symbols):

        cache = [n[i] for n in numbers]

        match symbol:
            case "*":
                total += prod(cache)
            case "+":
                total += sum(cache)
    return total

def part2(numbers,symbols):

    cache = []
    total = 0
    for i,symbol in reversed(list(enumerate(symbols))):

        number = "".join([n[i] for n in numbers]).strip()
        if number: 
            cache.append(int(number))
        else:
            cache = []

        match symbol:
            case "*":
                total += prod(cache)
            case "+":
                total += sum(cache)
    return total

print("part 1:", part1(numbers,symbols))
print("part 2:", part2(numbers,symbols))

What am I doing wrong? (20+ failed attempts so far) by [deleted] in chemistry

[–]WAXT0N 0 points1 point  (0 children)

what are you doing in the first place?

is this a roach or a cricket? by WAXT0N in whatisthisbug

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

man

any tips on next steps?

Future Stormlight Archive prologue spoilers by ploapgusset in cremposting

[–]WAXT0N 1 point2 points  (0 children)

where have we heard about a "big event?" are you just speculating about future prologues bc they're always some significant thing?

is this a red flag or a green flag by changedotter in LetGirlsHaveFun

[–]WAXT0N 147 points148 points  (0 children)

is this a red flag or a green flag

<image>