Inspired by recent popularity of nandgame on TNB, and my own previous challenge.
Background
Densely packed decimal (DPD) is a way to efficiently store decimal digits in binary. It stores three decimal digits (000 to 999) in 10 bits, which is much more efficient than naive BCD (which stores one ...
Let A be an m by n rectangular matrix of positive integers, where m and n are also positive integers.
We are interested in RoD ('Right-or-Down') paths from the upper-left cell of A to the lower right cell; in an RoD path, each successive cell of the path is either one cell to the Right of or on...
downsides: not sure if it would make semantic sense that all enums could be the same 'type', potentially introduces enum overhead by adding dynamic dispatch. upsides: all enum methods would be inherited which could be more idiomatic from an OO perspective
CMC Given a list, return the position of its "center of mass". The center of mass is defined as $\left(\sum_{x=1}^{n} m_ix\right)/M$, where $m_i$ is the value of that element and $M$ is the sum of the list. Test case: [1,3,2,6,9] -> ~3.90476 (1*1+3*2+2*3+6*4+9*5)/(1+3+2+6+9)
Given two different positions on a chess board and the type of piece, output the minimum number of moves it will take for that piece to go from one position to another.
Rules
The given piece can be King,Queen,Rook,Knight and Bishop. (This input can be taken as any 5 unique characters)
The 2 po...
I can kinda see two options here, "It's actually secret and I can't tell anyone" and "It's not documented anywhere but it doesn't actually matter if someone find out"
Keyboard Walk
Given a word (or any sequence of letters) as input, you must interpolate between each letter such that each adjacent pair of letters in the result is also adjacent on a QWERTY keyboard, as if you typed the input by walking on a giant keyboard. For example, 'yes' might become 'ytres...
@Pavel The previous comment is in reply to your last comment. Been a while since have had a decent match. Will extend the offer for the remainder of the day
@Adám yeah, though the only significant change is the ç key and the dead keys for the diacritics.
Friend of mine once brought me a mechanical keyboard when coming back from Germany. I had to type without looking at it because I used the PT-BR layout on windows but the physical keyboard was AZERTY and it confused the heck out of me
@EriktheOutgolfer Their site isn't very good. They will in fact make you anything, since they make them one by one and they have the APL overlay ready to apply to any keyboard layout.
@Neil oh wow, this is yet another problem for which you can write a 7 program for which it's unclear whether or not it's cheating: 007403 (6 characters, 2 bytes)
this takes the string literal 66, escapes it to produce 00, and then outputs it; the first 0 is interpreted as a request to use numeric mode, and the second 0 (in numeric mode) is interpreted as decrementing
so you get an output of -1
the difficulty here is determining a) what a negative number is in 7, b) what a numeric literal is in 7
@EriktheOutgolfer negative-zero is normally used as a placeholder for showing a negative number that was rounded to zero
however, as I said a bit below, you can actually type -0.0 and it will not make it 0.0
CMC: tell whether the input is -0.0 or 0.0; take it as a FLOAT OR DOUBLE please :P (the only functions that can use a string input verbatim are the atof and eval functions)
another possibility would be to use the cotangent function; 1/-0 seems to produce +infinity in Python, but maybe cotangent would handle the sign correctly
@DLosc (re: 46503709) Acc!! is obviously Turing-complete, and in fact doesn't even need the loop variables; you can write a boolean not (i.e. C's ! operator) using 0^ (this is the same technique used in Underload), so for any expressions a, b, c a*(0^((_%c)-b)) is a if _ equals b mod c or 0 otherwise, you can add those together to write a Tip program in a single expression
would be a pain to actually write in, though
maybe I should throw an Acc!!! cop up onto the original question :-)
Base Running
Given an input n, output the sum of the range [1...n] where each element e is ran through: base-e of n.
Example:
n = 10
Create the range [1...10]:
[1,2,3,4,5,6,7,8,9,10]
For each element e, get an array of the base-e digits of n:
[[1,1,1,1,1,1,1,1,1,1],[1,0,1,0],[1,0,1],[2...
My challenge is to make a Java method(s) that is given a String (another code in Java), removes any unnecessary characters, counts and returns the score, and displays the cleaned-up code in a way that can be copied/pasted.
It should ignore spaces, line breaks, etc. unless they are necessary to t...
Inspired by recent popularity of nandgame on TNB, and my own previous challenge.
Background
Densely packed decimal (DPD) is a way to efficiently store decimal digits in binary. It stores three decimal digits (000 to 999) in 10 bits, which is much more efficient than naive BCD (which stores one ...
Let A be an m by n rectangular matrix of positive integers, where m and n are also positive integers.
We are interested in RoD ('Right-or-Down') paths from the upper-left cell of A to the lower right cell; in an RoD path, each successive cell of the path is either one cell to the Right of or on...
Given two different positions on a chess board and the type of piece, output the minimum number of moves it will take for that piece to go from one position to another.
Rules
The given piece can be King,Queen,Rook,Knight and Bishop. (This input can be taken as any 5 unique characters)
The 2 po...
Base Running
Given an input n, output the sum of the range [1...n] where each element e is ran through: base-e of n.
Example:
n = 10
Create the range [1...10]:
[1,2,3,4,5,6,7,8,9,10]
For each element e, get an array of the base-e digits of n:
[[1,1,1,1,1,1,1,1,1,1],[1,0,1,0],[1,0,1],[2...
