reboot6675

joined 2 years ago
[–] [email protected] 30 points 2 days ago

"I fixed the problem by putting /* eslint-disable */ at the top of a file"

[–] [email protected] 6 points 1 week ago

Fuck this shit

[–] [email protected] 4 points 3 weeks ago

Mario Party Jamboree also pretty cool for party game

[–] [email protected] 2 points 4 weeks ago

Unfortunately I've struggled with this myself :/ (moving to a new country didn't help either)

[–] [email protected] 6 points 1 month ago (2 children)

I'd say go for it if you get the chance. Playing with other people is a game changer in your music journey. Then it's not only focusing on your playing but also on what the others are playing, following the tempo, the dynamics...

[–] [email protected] 3 points 1 month ago (1 children)

Related question, what CalDAV server are you using? Been looking for something lightweight

[–] [email protected] 2 points 1 month ago (8 children)

Wasn't Spotify Swedish tho? But yeah

[–] [email protected] 2 points 1 month ago

Agree with Zero Mission. Second would be Dread and then Super. Haven't played Fusion tho, long overdue...

[–] [email protected] 10 points 1 month ago

Usually artists go on tour after releasing a new album, to promote said album. So of course they're going to play new stuff.

The ideal for me is a good balance. Some new songs mixed with the classics.

[–] [email protected] 1 points 4 months ago (1 children)

Go

Using a map to store u|v relations. Part 2 sorting with a custom compare function worked very nicely

spoiler

func main() {
	file, _ := os.Open("input.txt")
	defer file.Close()
	scanner := bufio.NewScanner(file)

	mapPages := make(map[string][]string)
	rulesSection := true
	middleSumOk := 0
	middleSumNotOk := 0

	for scanner.Scan() {
		line := scanner.Text()
		if line == "" {
			rulesSection = false
			continue
		}

		if rulesSection {
			parts := strings.Split(line, "|")
			u, v := parts[0], parts[1]
			mapPages[u] = append(mapPages[u], v)
		} else {
			update := strings.Split(line, ",")
			isOk := true

			for i := 1; i < len(update); i++ {
				u, v := update[i-1], update[i]
				if !slices.Contains(mapPages[u], v) {
					isOk = false
					break
				}
			}

			middlePos := len(update) / 2
			if isOk {
				middlePage, _ := strconv.Atoi(update[middlePos])
				middleSumOk += middlePage
			} else {
				slices.SortFunc(update, func(u, v string) int {
					if slices.Contains(mapPages[u], v) {
						return -1
					} else if slices.Contains(mapPages[v], u) {
						return 1
					}
					return 0
				})
				middlePage, _ := strconv.Atoi(update[middlePos])
				middleSumNotOk += middlePage
			}
		}
	}

	fmt.Println("Part 1:", middleSumOk)
	fmt.Println("Part 2:", middleSumNotOk)
}

[–] [email protected] 1 points 4 months ago

Same, I initially also thought a|b and a|c implies a|c. However when I drew the graph of the example on paper, I suspected that all relations will be given, and coded it with that assumption, that turned out to be correct

 
 

GOAT

 

Came across this paper the other day. I'm yet to read it fully, but its existence is interesting already. Dumbphones have now gathered attention from the media and the academic world too.

3
Smile! (sopuli.xyz)
 

We're all gonna end up in one of those aren't we...

 

Stumbled upon this article about the rising popularity of dumbphones.

Hope this community starts getting more traction :)

As for my journey, I am still on a "dumb smartphone" phase, an old phone with only Whatsapp and Spotify. I've been considering making the switch to a dumb phone or at least a candybar smartphone like the Qin F21.

 
 

Context: the creator of Linux is from Finland

 

Context: this is a legit screenshot I took on my workplace around 1.5 years ago. Hopefully it's been patched by now? Completely ridiculous behavior

 

Had it saved on my hard drive for years and recently re-discovered it. Seems to be from 2011 (!!)

Google is getting worse by the year, but it seems even back then some people were already seeing where things were going.

(Credits to the original author whoever it might be)

view more: next ›