a) the move messages button is right below the delete room button, b) the relocate button is right next to the delete message button and c) entering a room name that doesn't exist will apparently create a new room
Things that previously weren't things I had to worry about :p
Given an array \$\left[x_0,x_1,x_2,...,x_{n-1}\right]\$, generate arguments \$a,b,c\$, such that \$ \forall 0 \le k < n, a \mod \left(bk+c\right) = x_k\$.
fastest-algorithm
Continuously Count Consecutive Cases
Background
Imagine that I'm creating a really long necklace, consisting of only two characters, A and B. You must count the number of occurrences of the substring AB in the string.
However, since it's a necklace, you must also consider if the last character an...
@mousetail Latin-1 is very Eurocentric, is it not? And even within Europe I think there is some bias, since I don't think Latin-1 includes letters like Serbo-Croatian đ or Czech ď,ň,ť
okay yeah why the heck is that letter in Latin-1? What languages even use it?
> It occurs in French as a variant of ⟨ï⟩ in a few proper nouns, as in the name of the Parisian suburb of L'Haÿ-les-Roses [la.i le ʁoz] and in the surname of the house of Croÿ [kʁu.i].
I need help (dis)?proving that given 0 < t < lcm(a,b), the following holds: `0 <= t%a*b + t%b*a - t*gcd(a,b) < a*b` I'm trying to make sure the formula used [here](https://codegolf.stackexchange.com/a/262883/112488) holds
Given an array \$\left[x_0,x_1,x_2,...,x_{n-1}\right]\$, generate arguments \$a,b,c\$, such that \$ \forall 0 \le k < n, a \mod \left(bk+c\right) = x_k\$.
fastest-algorithm
