Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Nice to see a MathGolf answer! To answer why there is a floor division by 4 operator, I had just implemented the ½ operator, and the next character in line was ¼. I knew it would be useful one of these days!
Wow, this is really impressive! I noticed that you're using omp.h to solve all of the puzzles in parallel. It was a long time since I hosted this challenge, so I can't remember the exact verdict on parallelization, but your solution would be either the fastest or second fastest running single-threaded. I'll try to get this benchmarked to get you an official score!
@KevinCruijssen you mean a count of occurrences (like Python's lst.count(x))? Unfortunately that's not included as of now. I haven't really had time to focus on the language in a while, but there are some unused bytes which could be used for new operators if I'm not mistaken.
You're right, I just tried it and noticed that the residues weren't distributed over all 26 possible values. I tried some different things (like the cube/factorial/fibonacci operators), but I haven't had any luck yet. Trying to analyze vv* now (one byte longer, but should avoid some of the issues above)
I haven't done the exact math on this, but since indexing repeats for indices that are higher than the length of a string/array (e.g. "abcd"9§ gives "b"), you could do something like ▄v²§ (link). Basically, get a random 32 bit integer, square it to skew the probabilities, and index the alphabet using the skewed random integer.
