Solved 2024/24 P1

This commit is contained in:
2024-12-24 09:30:21 +01:00
parent 1b58a3c6d4
commit 5bed995d01
9 changed files with 807 additions and 1 deletions
+1 -1
View File
@@ -123,7 +123,7 @@ Once the rounds are complete, you will be left with the numbers from `0`
to `255` in some order, called the *sparse hash*. Your next task is to
reduce these to a list of only `16` numbers called the *dense hash*. To
do this, use numeric bitwise
[XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) to combine
[](https://en.wikipedia.org/wiki/Bitwise_operation#) to combine
each consecutive block of `16` numbers in the sparse hash (there are
`16` such blocks in a list of `256` numbers). So, the first element in
the dense hash is the first sixteen elements of the sparse hash XOR\'d