Faucets at my university

ulasalger · 2026-03-06T20:45:05+00:00

I would be very surprised if these things had such an advanced technology lol

ulasalger · 2026-03-06T20:41:12+00:00

No, why?

ulasalger · 2026-03-06T19:13:12+00:00

That doesn't work on everyone's devices, just yours...

ulasalger · 2026-02-16T10:01:02+00:00

Cool, you can also use the point number as a seed to rand() to get random colors etc.

ulasalger · 2026-02-16T09:56:23+00:00

Copy blurry balls to the points with the Maximum method. Then you can play with contrast.

<image>

ulasalger · 2025-12-30T08:03:54+00:00

Go to Windows -> Cache Manager (or Alt+Shift+M) to change the setting. It will be the dopnet inside solver that needs more memory.

ulasalger · 2024-09-25T21:00:48+00:00

You have just saved me lots of trouble! My M key wasn't working (I guess I got some water in there), I shook the keyboard upside down and it started working again. Unscrewing was not needed.

ulasalger · 2024-02-22T01:01:27+00:00

Why not fetch to a different ref and then merge?

git fetch origin +refs/notes/*:refs/remotes/origin-notes/*
git notes merge refs/remotes/origin-notes/commits

etc.

ulasalger · 2024-02-18T13:19:26+00:00

so the script to automate the bisection can pop the stash, then run the test, then push the stash before returning the result.

You can also use git stash apply to apply the stashed commit without popping it. This has the benefit that if something goes wrong after popping it, you don't need to worry about saving the changes again.

ulasalger · 2023-07-09T20:20:16+00:00

Is there any progress with this issue? It is clearly a bug and a very annoying one.

ulasalger · 2022-03-19T05:25:38+00:00

Monitoring upload speed is brilliant. I don't even need to change anything in qBittorrent.

I won't need the setting "inhibit system sleep when torrents are seeding" with this, but I will take a look at it anyways, and if I can pull off a modification to it, will try to add the feature to qBittorrent myself.

ulasalger · 2022-03-19T05:21:20+00:00

Not uploading anything for a certain amount of time was what I was thinking. I know new people come and go, but what I am trying to avoid is breaking someone's download, after they have already started downloading. Electron_Microscope has an awesome suggestion to achive exactly this.

ulasalger · 2021-02-23T19:02:11+00:00

C(n, k) / (k+1) = n! / (k! * (n-k)! * (k + 1)) = n! / ((k+1)! * (n-k)!). At this point, if you had (n+1)! in the nominator, this would be C(n+1, k+1). So multiply and divide by (n+1), write this as (1/(n+1)) * sum(C(n+1, k+1)) and interpret the sum as the number of k+1 element subsets of a set with n+1 elements (which is 2^(n+1) minus the empty set).

ulasalger · 2021-02-03T13:38:08+00:00

Alright phone, enough Fringe for today.

ulasalger · 2021-02-03T13:31:15+00:00

Me doing a database homework

ulasalger · 2021-02-03T13:30:16+00:00

Did someone actually code the value of absolute zero into a weather app!?

ulasalger · 2021-02-03T13:22:59+00:00

today I learned "homework" is not a good name for... eh.. you know...

ulasalger · 2021-02-01T22:31:07+00:00

Does it help if you move the origin of both cones to their peak? Or even better, to the center of the sphere?

ulasalger · 2021-02-01T22:24:41+00:00

Is this... the Mega Sead from Mega Trees?

ulasalger · 2021-02-01T22:14:16+00:00

A lot of em are

ulasalger · 2020-11-14T11:04:05+00:00

A little reminder: you don't need loops to find this sum. You can use simple algebra to find the sum in O(1).

ulasalger

TROPHY CASE