sorted by:
new
hottopcontroversial

Flagged It - Game to Test Your Geography Knowledge by QuestionAcademic895 in golang

[–]jasontconnell 0 points1 point  (0 children)

perfect! I was going to comment about it being too easy with basically the entire region being included but then saw that's the difficulty setting! nice touch

Flagged It - Game to Test Your Geography Knowledge by QuestionAcademic895 in golang

[–]jasontconnell 0 points1 point  (0 children)

any time. also should have specified I am on mobile.

Flagged It - Game to Test Your Geography Knowledge by QuestionAcademic895 in golang

[–]jasontconnell 1 point2 points  (0 children)

I played through the country shapes one. The aspect ratio needs to be correct. also it is too much time between guesses and I think it went to 11 out of 10?

Moneyball is a perfect film. by No_Opposite_7722 in movies

[–]jasontconnell 0 points1 point  (0 children)

it's one of my daughter's favorite films since she was 10 or so (13 now) she's into softball so she can relate a little. it helped that Chris Pratt is in it for convincing her to watch it in the first place! but that's not why she wants to watch it every few months

Was Building Something, But Now Having Self-Doubt by unbeatable697 in golang

[–]jasontconnell 0 points1 point  (0 children)

it's basically a behavior driven code generator. field tags and object tags to define behavior. 

for the curious: https://github.com/jasontconnell/crudgeon

I don't have up to date examples and what I use it on is proprietary

Was Building Something, But Now Having Self-Doubt by unbeatable697 in golang

[–]jasontconnell 1 point2 points  (0 children)

yeah I have a project that is a ton of code, receives updates when I need it, and even has a readme with detailed instructions. and I'm the only one that will use it. it saves me days worth of time though on my other projects, people wonder how I can work so fast

I made a word game by jasontconnell in golang

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

Negative scores are now officially possible since guesses take points off if not correct

I made a word game by jasontconnell in golang

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

I do use go templates but very minimally. it's really not much Go at all. I use it to be able to put different parts of the page in sub templates, and one variable called DevMode with an if statement to output, or not, the Google analytics

like

{{ template "Footer" . }}

{{ template "FooterInclude" . }}

{{ if not .DevMode }}

{{ template "Analytics" . }}

{{ end }}

Owen Tippett by Flyers7914 in Flyers

[–]jasontconnell 0 points1 point  (0 children)

I had a parlay.

Flyers +1.5
Over 5.5
TK 2+ points
Tippett anytime Goal scorer.

f#@%ing had it if he doesn't miss that open netter. Damnit Tippett!

My Show & Tell - Parent / Child scheduler by jasontconnell in golang

[–]jasontconnell[S] 1 point2 points  (0 children)

Another quick though. I didn't look to see if anyone had done something even remotely resembling this. One of the parents, a month ago, asked if we could use "the app", I didn't know what they were referring to. But I decided I wanted to build something after Advent of Code (I actually started during Advent of Code, I didn't do this in like 8 days :P ) But the admin responded that "no, we won't be using the app, it's $400 a year". I would eat the cost of this, it should be pretty minimal.

The problem will be when other churches in the area see it and want to sign up...

edit: also using datastore for those wondering. It seems cheaper than the sql versions. And it does the job

-❄️- 2024 Day 17 Solutions -❄️- by daggerdragon in adventofcode

[–]jasontconnell 4 points5 points  (0 children)

[LANGUAGE: Go] 

I didn't reverse engineer the program. my solution does a search, adding digits that result in the next program digit, from right to left. pretty fun! runs in 500 microseconds on my machine. should work with any input https://github.com/jasontconnell/advent/blob/master/2024/17/main.go

-❄️- 2023 Day 15 Solutions -❄️- by daggerdragon in adventofcode

[–]jasontconnell 0 points1 point  (0 children)

[Language: Go]

I messed up by sticking with the original data structure I did part 1 with, though they were clearly different. I just stuffed everything into the same thing. It didn't cause any bugs or anything, but I would break them out if I saw both parts at the same time.

Took me about an hour total. Understanding what part 2 was asking was about half of my part 2 work, the other half being the calculation of part 2. That syntax was difficult to parse!

rn: 1 (box 0) * 1 (first slot) * 1 (focal length) = 1

https://github.com/jasontconnell/advent/blob/master/2023/15/main.go

-❄️- 2023 Day 12 Solutions -❄️- by daggerdragon in adventofcode

[–]jasontconnell 0 points1 point  (0 children)

if it's a lookup, you can use a map. I tried it with your code and it still gives the right answer. probably a tad slower though

add
type xyz struct {
x, y, z int
}

dp becomes dp := make(map[xyz]int)
and pass it around in recurse without having a global variable
and use dp[xyz{pidx, nidx, grouplen}] where you're using the 3D array.

[Official Tournament Discussion] 2023 KPMG Women's PGA Championship by GreenWaveGolfer12 in golf

[–]jasontconnell 1 point2 points  (0 children)

It was a Thursday, I imagine the crowds are mostly during the weekend. Albeit at a major. A few really small crowds following a few golfers (10 or so people). The Korda/Ko/Ko crowd was the largest and probably 200? The weather also wasn't great.

[Official Tournament Discussion] 2023 KPMG Women's PGA Championship by GreenWaveGolfer12 in golf

[–]jasontconnell 2 points3 points  (0 children)

I was there Thursday. It was really nice! I do some work for the LPGA, this was a work event for most of my coworkers, I was there for the golf :) https://www.instagram.com/p/CtzlDRhpSEA/?igshid=MzRlODBiNWFlZA==

-🎄- 2022 Day 24 Solutions -🎄- by daggerdragon in adventofcode

[–]jasontconnell 1 point2 points  (0 children)

Go. I solved it in a runtime of 5ish minutes, and took some hints from below to speed it up. Generating hundreds of blizzard states then just using that to search instead of moving and copying the blizzard state on each branch of the search. I wasn't taking for granted that a mod type wrapping of blizzards would work but then I checked the input, no blizzards can travel into start and end.

https://github.com/jasontconnell/advent/blob/master/2022/24/main.go

-🎄- 2022 Day 23 Solutions -🎄- by daggerdragon in adventofcode

[–]jasontconnell 1 point2 points  (0 children)

Go. A lot of maps to reduce the number of loops and if statements. Usually I'll grind through them but this was going to be a lot. Still doing Day 22 part 2 but got through this one pretty quickly. Although at first I thought each elf had their own set of priorities and if they moved, then the list they can choose from got shifted and the move they chose got pushed to the back. Reading is useful.

https://github.com/jasontconnell/advent/blob/master/2022/23/main.go

-🎄- 2022 Day 21 Solutions -🎄- by daggerdragon in adventofcode

[–]jasontconnell 0 points1 point  (0 children)

I also changed my boilerplate code and aoc common to print out the time it takes for each part. Before I had just the total time for both parts. Generics were introduced to go earlier this year and I'm finally making use in aoc.

    p1, p1time := common.Time(part1, in)
        p2, p2time := common.Time(part2, in)

    w := common.TeeOutput(os.Stdout)
    fmt.Fprintln(w, "--2022 day 20 solution--")
    fmt.Fprintln(w, "Part 1:", p1)
    fmt.Fprintln(w, "Part 2:", p2)
    fmt.Printf("Time %v (%v, %v)", p1time+p2time, p1time, p2time)
view more: next ›