#day8 — Public Fediverse posts

https://www.europesays.com/lu-fr/11961/ Emma Siegers à nouveau au top en Tchéquie #d1 #Day8 #day8 #DivisionUn #EersteKlasse #FirstDivision #foot #FOOTBALL #luik #Luxembourg #PlayOffs #po2 #pob #PremiereDivision #soccer #voetbal

It‘s quite cold in Lhonak 4753m. Send us some warm ☀️☀️☀️ please for tomorrow.

#greathimalayatrail
#nepal
#day8

It‘s quite cold in Lhonak 4753m. Send us some warm ☀️☀️☀️ please for tomorrow.

#greathimalayatrail
#nepal
#day8

It‘s quite cold in Lhonak 4753m. Send us some warm ☀️☀️☀️ please for tomorrow.

#greathimalayatrail
#nepal
#day8

It‘s quite cold in Lhonak 4753m. Send us some warm ☀️☀️☀️ please for tomorrow.

#greathimalayatrail
#nepal
#day8

#Day8 | Distributions – Circular | #30DayChartChallenge | Elevation distribution in the most circular department of Honduras. Built with #RStats using #sf, #raster, #exactextractr, #ggplot2, #ggnewscale, #ggtext, #dplyr, #terra, #showtext, #scales, #patchwork and #ggspatial.

#Day8 | Distributions – Circular | #30DayChartChallenge | Elevation distribution in the most circular department of Honduras. Built with #RStats using #sf, #raster, #exactextractr, #ggplot2, #ggnewscale, #ggtext, #dplyr, #terra, #showtext, #scales, #patchwork and #ggspatial.

#Day8 | Distributions – Circular | #30DayChartChallenge | Elevation distribution in the most circular department of Honduras. Built with #RStats using #sf, #raster, #exactextractr, #ggplot2, #ggnewscale, #ggtext, #dplyr, #terra, #showtext, #scales, #patchwork and #ggspatial.

Day 8 marks the 5th appearance of this whisky in an advent calendar for me: Glenfiddich's Gran Reserva 21 year old single malt at 40% ABV. Tastes just as I remember: fruitcake in a glass with an oaken finish.

Yet Another Busy Night (a wake, the FrizzLit Moby Dick Book Club, other projects), so this is just the dram framed up on top of last night's project, a map from Edgar Rice Burroughs I'm redrawing to use as endpapers for bookbinding.

#photography #drinks #whisky #whiskyadvent2025 #day8

Day 8 marks the 5th appearance of this whisky in an advent calendar for me: Glenfiddich's Gran Reserva 21 year old single malt at 40% ABV. Tastes just as I remember: fruitcake in a glass with an oaken finish.

Yet Another Busy Night (a wake, the FrizzLit Moby Dick Book Club, other projects), so this is just the dram framed up on top of last night's project, a map from Edgar Rice Burroughs I'm redrawing to use as endpapers for bookbinding.

#photography #drinks #whisky #whiskyadvent2025 #day8

Day 8 marks the 5th appearance of this whisky in an advent calendar for me: Glenfiddich's Gran Reserva 21 year old single malt at 40% ABV. Tastes just as I remember: fruitcake in a glass with an oaken finish.

Yet Another Busy Night (a wake, the FrizzLit Moby Dick Book Club, other projects), so this is just the dram framed up on top of last night's project, a map from Edgar Rice Burroughs I'm redrawing to use as endpapers for bookbinding.

#photography #drinks #whisky #whiskyadvent2025 #day8

Day 8 marks the 5th appearance of this whisky in an advent calendar for me: Glenfiddich's Gran Reserva 21 year old single malt at 40% ABV. Tastes just as I remember: fruitcake in a glass with an oaken finish.

Yet Another Busy Night (a wake, the FrizzLit Moby Dick Book Club, other projects), so this is just the dram framed up on top of last night's project, a map from Edgar Rice Burroughs I'm redrawing to use as endpapers for bookbinding.

#photography #drinks #whisky #whiskyadvent2025 #day8

Day 8 marks the 5th appearance of this whisky in an advent calendar for me: Glenfiddich's Gran Reserva 21 year old single malt at 40% ABV. Tastes just as I remember: fruitcake in a glass with an oaken finish.

Yet Another Busy Night (a wake, the FrizzLit Moby Dick Book Club, other projects), so this is just the dram framed up on top of last night's project, a map from Edgar Rice Burroughs I'm redrawing to use as endpapers for bookbinding.

#photography #drinks #whisky #whiskyadvent2025 #day8

#AdventOfCode #Day8 with #rust

I spent an inordinate amount of time on part1 because
* imo the problem definition is wrong
* it does matter if you put permutations or combinations in the list, even if you filter them out :(

Part 2 is basically the same and I already did it in ruby so I'm not doing it again, at least not today.

I wanted to do this with union-find but I have yet to get to the chapter about generics and it seems cheating to do it without it :)

https://gist.github.com/riffraff/267f1e326e447815ab0ac28f217bc01f

#AdventOfCode #Day8 with #rust

I spent an inordinate amount of time on part1 because
* imo the problem definition is wrong
* it does matter if you put permutations or combinations in the list, even if you filter them out :(

Part 2 is basically the same and I already did it in ruby so I'm not doing it again, at least not today.

I wanted to do this with union-find but I have yet to get to the chapter about generics and it seems cheating to do it without it :)

https://gist.github.com/riffraff/267f1e326e447815ab0ac28f217bc01f

#AdventOfCode #Day8 with #rust

I spent an inordinate amount of time on part1 because
* imo the problem definition is wrong
* it does matter if you put permutations or combinations in the list, even if you filter them out :(

Part 2 is basically the same and I already did it in ruby so I'm not doing it again, at least not today.

I wanted to do this with union-find but I have yet to get to the chapter about generics and it seems cheating to do it without it :)

https://gist.github.com/riffraff/267f1e326e447815ab0ac28f217bc01f

#AdventOfCode #Day8 with #rust

I spent an inordinate amount of time on part1 because
* imo the problem definition is wrong
* it does matter if you put permutations or combinations in the list, even if you filter them out :(

Part 2 is basically the same and I already did it in ruby so I'm not doing it again, at least not today.

I wanted to do this with union-find but I have yet to get to the chapter about generics and it seems cheating to do it without it :)

https://gist.github.com/riffraff/267f1e326e447815ab0ac28f217bc01f

#AdventOfCode #Day8 with #rust

I spent an inordinate amount of time on part1 because
* imo the problem definition is wrong
* it does matter if you put permutations or combinations in the list, even if you filter them out :(

Part 2 is basically the same and I already did it in ruby so I'm not doing it again, at least not today.

I wanted to do this with union-find but I have yet to get to the chapter about generics and it seems cheating to do it without it :)

https://gist.github.com/riffraff/267f1e326e447815ab0ac28f217bc01f

Day 8 done.

Now that's what I call Advent of Code! I'm happy with the algorithm for the most part. I'm sure it could be improved, but I paired up all boxes and pushed them into a BinaryHeap based on their squared distances, then popped the number based on the number of connections to consider (1000 for the real input). These I pushed into a set of "network" HashSets. This is the part I'm least happy with. I iterate the vector of networks to match each point to a network, and if they're both in a network, I extend the earlier one from the later and remove the later. I considered a lot of ways to improve this, but couldn't come up with one that wouldn't be either buggy or inefficient. I'll probably look at the Reddit solutions thread to see how other people tackled it.

Part 2 was really similar in execution to part 1, but continuing until all points were in a network and there was only one network, and keeping track of the last pair added.

Whew, this one was just the right amount of challenging and fun. Most of the days were pretty easy before today's. Now all we're missing is a nice A* problem.

#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day8 #AdventOfCode2025Day08 #Day8 #Day08 #Rust #RustLang #Programming #CodingChallenges

Day 8 done.

Now that's what I call Advent of Code! I'm happy with the algorithm for the most part. I'm sure it could be improved, but I paired up all boxes and pushed them into a BinaryHeap based on their squared distances, then popped the number based on the number of connections to consider (1000 for the real input). These I pushed into a set of "network" HashSets. This is the part I'm least happy with. I iterate the vector of networks to match each point to a network, and if they're both in a network, I extend the earlier one from the later and remove the later. I considered a lot of ways to improve this, but couldn't come up with one that wouldn't be either buggy or inefficient. I'll probably look at the Reddit solutions thread to see how other people tackled it.

Part 2 was really similar in execution to part 1, but continuing until all points were in a network and there was only one network, and keeping track of the last pair added.

Whew, this one was just the right amount of challenging and fun. Most of the days were pretty easy before today's. Now all we're missing is a nice A* problem.

#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day8 #AdventOfCode2025Day08 #Day8 #Day08 #Rust #RustLang #Programming #CodingChallenges

Day 8 done.

Now that's what I call Advent of Code! I'm happy with the algorithm for the most part. I'm sure it could be improved, but I paired up all boxes and pushed them into a BinaryHeap based on their squared distances, then popped the number based on the number of connections to consider (1000 for the real input). These I pushed into a set of "network" HashSets. This is the part I'm least happy with. I iterate the vector of networks to match each point to a network, and if they're both in a network, I extend the earlier one from the later and remove the later. I considered a lot of ways to improve this, but couldn't come up with one that wouldn't be either buggy or inefficient. I'll probably look at the Reddit solutions thread to see how other people tackled it.

Part 2 was really similar in execution to part 1, but continuing until all points were in a network and there was only one network, and keeping track of the last pair added.

Whew, this one was just the right amount of challenging and fun. Most of the days were pretty easy before today's. Now all we're missing is a nice A* problem.

#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day8 #AdventOfCode2025Day08 #Day8 #Day08 #Rust #RustLang #Programming #CodingChallenges

Day 8 done.

Now that's what I call Advent of Code! I'm happy with the algorithm for the most part. I'm sure it could be improved, but I paired up all boxes and pushed them into a BinaryHeap based on their squared distances, then popped the number based on the number of connections to consider (1000 for the real input). These I pushed into a set of "network" HashSets. This is the part I'm least happy with. I iterate the vector of networks to match each point to a network, and if they're both in a network, I extend the earlier one from the later and remove the later. I considered a lot of ways to improve this, but couldn't come up with one that wouldn't be either buggy or inefficient. I'll probably look at the Reddit solutions thread to see how other people tackled it.

Part 2 was really similar in execution to part 1, but continuing until all points were in a network and there was only one network, and keeping track of the last pair added.

Whew, this one was just the right amount of challenging and fun. Most of the days were pretty easy before today's. Now all we're missing is a nice A* problem.

#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day8 #AdventOfCode2025Day08 #Day8 #Day08 #Rust #RustLang #Programming #CodingChallenges

Day 8 done.

Now that's what I call Advent of Code! I'm happy with the algorithm for the most part. I'm sure it could be improved, but I paired up all boxes and pushed them into a BinaryHeap based on their squared distances, then popped the number based on the number of connections to consider (1000 for the real input). These I pushed into a set of "network" HashSets. This is the part I'm least happy with. I iterate the vector of networks to match each point to a network, and if they're both in a network, I extend the earlier one from the later and remove the later. I considered a lot of ways to improve this, but couldn't come up with one that wouldn't be either buggy or inefficient. I'll probably look at the Reddit solutions thread to see how other people tackled it.

Part 2 was really similar in execution to part 1, but continuing until all points were in a network and there was only one network, and keeping track of the last pair added.

Whew, this one was just the right amount of challenging and fun. Most of the days were pretty easy before today's. Now all we're missing is a nice A* problem.

#AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day8 #AdventOfCode2025Day08 #Day8 #Day08 #Rust #RustLang #Programming #CodingChallenges

#30DayAlbumCoverChallenge
#Day8 Álbum que tenga un animal en él

#APerfectCircle #ThirteenStep #ElTerceroQueSeMeHaVenidoALaCabeza #MeDaAsqueteLaPortadaPeroEsUnBuenDisco

#30DayAlbumCoverChallenge
#Day8 Álbum que tenga un animal en él

#APerfectCircle #ThirteenStep #ElTerceroQueSeMeHaVenidoALaCabeza #MeDaAsqueteLaPortadaPeroEsUnBuenDisco

#30DayAlbumCoverChallenge
#Day8 Álbum que tenga un animal en él

#APerfectCircle #ThirteenStep #ElTerceroQueSeMeHaVenidoALaCabeza #MeDaAsqueteLaPortadaPeroEsUnBuenDisco

#30DayAlbumCoverChallenge
#Day8 Álbum que tenga un animal en él

#APerfectCircle #ThirteenStep #ElTerceroQueSeMeHaVenidoALaCabeza #MeDaAsqueteLaPortadaPeroEsUnBuenDisco

#30DayAlbumCoverChallenge
#Day8 Álbum que tenga un animal en él

#APerfectCircle #ThirteenStep #ElTerceroQueSeMeHaVenidoALaCabeza #MeDaAsqueteLaPortadaPeroEsUnBuenDisco

#30DayMapChallenge #Day8
Urban
Saint Petersburg, Russia. My Centre.
Today I focused on a lightweight, yet informative basemap, which I could use in other projects.
I called it My Center, because there are a lot of opinions what is to be called the centre. This is my view.
Tools - QGIS, QuickOSM
The style is based on the "Urban" style in the QuickOSM preset
Data - ©OpenStreetMap openstreetmap.org/copyright
Source code - https://github.com/SavelevGeo/pop_maps

This one took about an hour from start to finish. If nothing else, this guy's got some real personality to him! #gobtober #day8 #shaman #ttrpg #goblin

This one took about an hour from start to finish. If nothing else, this guy's got some real personality to him! #gobtober #day8 #shaman #ttrpg #goblin

This one took about an hour from start to finish. If nothing else, this guy's got some real personality to him! #gobtober #day8 #shaman #ttrpg #goblin

My wife’s drawing for today. #Inktober #Inktober2025 #Day8 #reckless

My wife’s drawing for today. #Inktober #Inktober2025 #Day8 #reckless

My wife’s drawing for today. #Inktober #Inktober2025 #Day8 #reckless

My wife’s drawing for today. #Inktober #Inktober2025 #Day8 #reckless

My wife’s drawing for today. #Inktober #Inktober2025 #Day8 #reckless

#Inktober #Inktober2025 #LineaSketch #Day8 #reckless

Wreck-It-Ralph would be considered a reckless character, right?

#Inktober #Inktober2025 #LineaSketch #Day8 #reckless

Wreck-It-Ralph would be considered a reckless character, right?

#Inktober #Inktober2025 #LineaSketch #Day8 #reckless

Wreck-It-Ralph would be considered a reckless character, right?

#Inktober #Inktober2025 #LineaSketch #Day8 #reckless

Wreck-It-Ralph would be considered a reckless character, right?

#Inktober #Inktober2025 #LineaSketch #Day8 #reckless

Wreck-It-Ralph would be considered a reckless character, right?

A little Octagonal & Heptagonal walk

for #Mathober #Mathober2025 #Day8 #loop #geogebra