CMC: given a list of nonnegative, pretty print the list of nonzero indices and their values, with the lists lining up visually, and the zero indices / values place being taken up by .... Example: (1 indexed) [0, 0, 5, 0, 11, 23, 0, 0, 0, 0, 0, 7] => ... 3 ... 5 6 ... 12\n... 5 ... 11 23 ... 7
the exact format is flexible, as long as the lines never desync (each index is aligned with its value)
Obfuscated bananas
In this challenge, your task is to print the string banana, case insensitive, to STDOUT (or an acceptable alternative) in the most obfuscated way.
+1 VTC! No objective winning criterion!
Wrong! I now have an objective winning criterion!
Let the reporter edit distance of \$a...
Minimum Escaping open-ended-function
Your task is to write 2 functions/programs. They may share code.
The first function must, given a string and a character, output a new string that does not contain that character.
The second function must, given the string from the previous function and the ex...
Confiscation < Detention < Mulct < Fine < Qualification suspension < Disqualification < Jail without labor < Jail with labor < Death penalty, according to Korean criminal laws.
Does anyone know why both my shift keys may have stopped working?
They do still work, but only intermittently. If I let them "rest" for a few hours, they're more likely to work, and after a few minutes of use, they go back to working maybe 1 times out of 30
I've had to remap capslock to shift, and that does work, so I don't know what's up
This is the keyboard built into my laptop (an HP, if it matters)
@Ginger Just googled it, I don't think so (membrane keyboard don't have much tactile feedback, right? My keyboard does have some travel and makes a bit of noise)
I'd advise you take it to a computer repair shop and have someone who knows what they're doing look at it, instead of asking some cat on the internet :p
@thejonymyster I would argue that the knight is explicitly jumping, despite the fact that its move isn't orthogonal. In Xiangqi (Chinese chess), the horse has a similar (2,1) move, but it can be blocked if another piece is in the way.
although i do also feel like there's a certain extent to which knight moves are conceptualized as (2,0)-(0,1), at least in a popular capacity among laymen if not meaningfully to the game itself, in which case that would have to be a jump
Input
The code should take an integer \$n\$ between 1 and 1000.
Output
The code should output positive integers with \$n\$ bits. Accompanying each integer should be its full factorization. Each integer should be a uniformly random \$n\$ bit number.
Score
The score for your code will be the number...
to clarify i guess since both of you brought that up; a language not having literals is one thing, i meant more like is it always clear whether something is / isnt a literal
which is something i definitely, absolutely was clear about when i first asked. for sure. dont even check :P