Given a sequence of bytes, output the SHA-256 hash value of the sequence.
The SHA-256 Algorithm
The following pseudocode is taken from the Wikipedia page for SHA-2.
Note 1: All variables are 32 bit unsigned integers and addition is calculated modulo 2^32
Note 2: For each round, there is one ro...
I actually don't know, I really do not, if this challenge is achievable.
Write some code, in any language.
I must be able to run it in an online code runner such as tio.run
If I run it twice, both will fail with some kind of error message.
The third time I run it, it should succeed.
It's a code...
gcc C++ n ≈ 36 (57 seconds on my system)
Uses Glynn formula with a Gray code for updates if all column sums are even, otherwise uses Ryser's method. Threaded and vectorized. Optimized for AVX, so don't expect much on older processors. Don't bother with n>=35 for a matrix with only +1's even if y...
Nonogram line brute-force solving code-golf puzzle-solver
Background
Nonogram, also known as Picross or Griddlers, is a puzzle where the objective is to determine if each cell on the 2D grid should be colored or left blank, using the numbers of consecutive colored cells on each line.
The follo...
C, 0.026119s (Mar 12 2016)
#include <math.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define cache_size 16384
#define Phi_prec_max (47 * a)
#define bit(k) (1ULL << ((k) & 63))
#define word(k) sieve[(k) >> 6]
#define sbit(k) ((word(k >> 1) >
There's a type of matrix called the Weyr canonical form. A characteristic example is:
A Weyr matrix is an n×n upper triangular matrix such that:
n1 ≥ n2 ≥ ... ≥ nr
n1 + n2 + ... + nr = n
the ith diagonal block is λ times the ni×ni identity matrix
the first superdiagonal blocks are ni×ni+1 ma...
I'm repeating some things from my last comment, but leaving them here for completeness.
I think that now the requirements are much better
The requirements are much less clear with the added edge cases, so I have closed the challenge for now.
I went through and tested every single answer ...
Create random recurrences with their solutions
(This is a work in progress and I would love any help please.)
The task is to create random recurrence relations that are solvable using the Akra-Bazzi method along with the solutions. This method solves recurrences of the form:
{\displaystyle T(x...
I found a bug in a code golf submission but do not yet have commenting privilege. Is there a polite way for me to let the user know about this bug?
The side offers me to "suggest an edit" but I'm not sure wether doing so would be against the rules/etiquette/good manners.
