@Seggan you can simulate logical or with addition and logical and with multiplication if need be. The use of dedicated logical comparisons would be for short circuit stuff
Simplify Rubik's Cube Moves
Background
On a Rubik's cube there are 54 moves that you can execute, for example, turn the right face anti-clockwise, or rotate the top face and the horizontal slice twice. To notate any move, each face (or slice) has a letter assigned to it. To move that face clockwi...
you see I couldn't have seen @NoHaxJustRadvylf's comment, but then i had a very good idea, I used F5, see using F5 gave me a whole new perspective and i was able to see his comment
Also, I was watching a video on escape rooms in minecraft and then I had a very good idea. I used f5. See, using f5 gave me a whole new perspective and I was able to see a Radvylf comment making an f5 joke
My phone number (which I will not be sharing here) has a neat property where there is a two digit number, which when iteratively removed from my phone number will eventually remove all the digits. For example if my phone number were
abaababbab
Then by repeatedly removing ab we would eventually ...
Sometimes, Jelly's design choices confuse me. For example, œṡ (the "split the left argument at the first occurrence of the right argument" atom), for some reason, vectorises when the right argument is a list: Try it online!
@lyxal Yeah, the normal split atom, ṣ only splits on "simple" types. But, it doesn't vectorise, it just does nothing if the right argument isn't "in" the left argument
@att i'm wanting the test set to be hiragana only, so no katakana nor kanji in the test cases
test case format would be `VERB CATEGORY` so 要る/居る would have test case `いる 5` or `いる 1`. verbs that can be either, i'm allowing submissions to also output either (as long as it's consistent)
In this challenge, you will be "reversing" the alphabet or swapping a-z with z-a. This is commonly known as the Atbash cypher.
Because this transformation makes the output look like some foreign language, your code will need to be as short as possible.
Examples
abcdefghijklmnopqrstuvwxyz
zyx...
beats ØaiCịØa which it would tie if i and ị didn't have opposite argument orders
incidentally i feel like this could end up being 3 bytes in perhaps with some design decisions i've been thinking of
namely, list nilads implicitly indexing into themselves in cases where it's not useful for them to act as nilads--both "unparseable" chain positions, and possibly some if not most operators
but for non-numeric inputs it may as well find the index instead
so hypothetically this could be complement under lowercase-alphabet (or bitwise-not under lowercase-alphabet if i go with 0-indexing) if the lowercase alphabet seems worth having as one byte
Implement level-index addition
code-golfrestricted-time
Level-index is an alternative number representation to floating-point which claims to virtually eliminate overflow (and underflow, in its symmetric form). It expresses numbers as power towers: specifically, for any nonnegative number \$x\$, ...