@Lyxal Since I can't upload pictures when editing your profile, I've reverted you to your own identicon; in case you need it, I have a link to your old PFP here.
The language is based around programs being palindromic, and stack based, so stackcats. Add in a space and some capitalisation to give it a better name
@Wasif I am removing this answer as per our policy for handling invalid submissions, since permutations is not defined in standard Python and you must include the bytes for importing that function from the itertools module. Feel free to edit to a valid solution and flag for undeletion.
(/s)
also BTW you don't need to list() the permutations result because map accepts any iterable
@Wasif Stack Cats is actually a really interesting language, and the language name works of the central premise. Essentially every program is an odd number of characters, where the second half is a visual reflection of the first half (e.g Wv\<*>/vW). The commands in the second half deliberately undo what was done in the first half, so the program boils down to finding a central character which changes the behaviour of the program
Essentially all the commands that are visually palindromic (e.g. *, ^, +) are self-inverse, and all "reflected" characters ([], \/ etc.) are inverses of each other
Programming in it is highly non-trivial, and most submissions in it use brute-force, or the (...)*(...) construct which only executes the contents of the second bracket. There's a +1100 deadlinesless bounty for figuring out how to code non-trivial programs in it, that don't use the above construct
i'm implementing rotations (the same ones AVL trees use for rebalancing) in my esolang; what should a left rotation do if the node is its parent's left child or right rotation as a right child?
i know a bit of C (using it for an esolang right now, and wrote some things for CS146 in it) so i might be able to help but idk if i know more than you lol
@pxeger Even more interestingly: I awarded a +500 bounty (so a gross loss of 500), then got +200 from upvotes (net loss of -300) and it counted towards Epic
@user "not counting repeated events cause then it's infinite"
A \$k\$-hyperperfect number is a natural number \$n \ge 1\$ such that
$$n = 1 + k(\sigma(n) − n − 1)$$
where \$\sigma(n)\$ is the sum of the divisors of \$n\$. Note that \$\sigma(n) - n\$ is the proper divisor sum of \$n\$. The sequence of \$k\$-hyperperfect numbers begins
$$6, 21, 28, 301, 325, ...
So long as n doesn't equal 1, floor(x / n) = (x - 1) / n (if x-1 is divisible by n), and n = Æṣ’ equals 1 if Æṣ equals 2, which it can never do as it's always 1 + something where something != 1
So yes, it's valid
Fun fact, Æṣ has only been used in 10 answers (no counting any posted after the 11th)
I don't like bountying challenges like hello world because I get notified of new answers, and for a brief second I'm unsure if I'm still redwolf or if I'm actually an experiment by a super high rep long time user and the entire life I thought I knew was simulated in GoL for fun