for the "Escape the black hole!" challenge: the win/whatever_in_linux keys stay untouched so if you write an AHK script like LWin::O you can calmly write a Lenguage code with only one Win key
Shifty XORryption
code-golf
Write a program or function (or set of programs/functions) to encrypt and decrypt data given the following specification:
Encryption
Calculate an XOR hash of the input by XOR-ing every byte with eachother.
XOR every byte of the input by this hash.
Shift the result...
@Pietu1998 I see, thanks. Seems a bit unnecessary, maybe will be removed in python 4. :) Are there some other similar language construct which looks like a function?
This question is basically being used to host some test answers for EOEIS. Feel free to contribute your own test answers, following the format below. You don't actually have to do any programming.
# [language], [number] bytes, depth [number], A[new sequence] from A[old sequence]
Like this:
...
Yes, there is an algorithm that only uses multiplication. This algorithm uses a lot of precomputation, but generates a simple expression that can be used to check for divisibility.
For example, if you have an 4 bit integer, and want to check if it's divisible by 3 it's enough to check (using 4-b...
I'm trying to work on the feature that detects valid chaining.
So, I basically want to create a "list of lists"-type-thing in Javascript, which I don't know how to do. The list will be the sequences that have been used, and a list of which people are ineligible to chain off those sequences.
I think I know a way to do it, but it's super hacky.
@Optimizer the nibbles of the hash should fill in the space on either side of the original input after the shift so that the end result is 1 byte longer than the input
Run-length encoding (RLE) is a very simple form of data compression in which runs of data (that is, sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run. This is most useful on data that contains many such runs. Consider, for example, simple graphic images such as icons, line drawings, and animations. It is not useful with files that don't have many runs as it could greatly increase the file size.
RLE may also be used to refer to an early graphics file format supported by CompuServe for ...
No. The logic works only if there are 3 cells with only 2 candidates. So in this example [A B] has to be [8 9], [A C] has to be [1 9] and [B C] has to be [1 8]. The only cell that is allowed to have != 2 candidates is the cell [C D].