0
Binary Numbers Magic Trick
code-golfnumberskolmogorov-complexitymatrix
The challenge is simply; output the following six 2D integer arrays:
[[ 1, 11, 21, 31, 41, 51],
[ 3, 13, 23, 33, 43, 53],
[ 7, 17, 27, 37, 47, 57],
[ 9, 19, 29, 39, 49, 59]]
[[ 2, 11, 22, 31, 42, 51],
[ 3, 14, 23, 34, ...
Input
Integers a1, a2, a3, b1, b2, b3 each in the range 1 to 20.
Output
True if a1^(a2^a3) > b1^(b2^b3) and False otherwise.
^ is exponentiation in this question.
Rules
This is code-golf. Your code must terminate correctly within 10 seconds for any valid input on a standard desktop PC.
Y...
This question is motivated by the lack of concurrency related puzzles on PPCG. The goal of this question is to solve the Dining Philosophers Problem.
What is the dining philosophers problem (DPP) ?
The DPP is one of the most famous concurrency problem, used to illustrate what is a deadlock fo...
Right now, there are two challenges,
Newer challenge: Check if a string is entirely made of the same substring by ouflak
Older challenge: String.prototype.isRepeated by Optimizer
which are, as far as I can tell, the exact same challenge. This has happened before, and sparked the following dis...
There is an old, popular riddle:
Find an english word with 8 letters that, taken away one letter, creates a new valid word. Repeat that until there is no letters left.
Example solution:
starting
staring
string
sting
sing
sin
in
I
Write a script that, given a file with words*, outputs one...
A few hours earlier, I got this puzzle:
Suppose, you toss a coin n times, then what the probability of getting m number of heads? ( where m is the set of all prime numbers)
For instance, take n = 2, then
SS = { HH, HT, TH, TT }
So, output is 1/4 (for HH case)
Then, for n = 3,
SS = { HHH, ...
I need to write an OCaml program that return all possible zip of two lists together while preserving the order of the element in each list. For example, if we zip the lists [1;2] and [3;4], we get [[1;2;3;4];[1;3;4;2];[3;1;2;4];[1;3;2;4];[3;1;4;2];[3;4;1;2]].
My naïve approach is to append each ...
Shantae Dance Matching
code-golf sequence
In the original Shantae game, there are transformation dances that you have to input in time using the D-Pad, A, and B. If you complete a predefined sequence while dancing, you will transform into the corresponding form (or teleport or heal). Your tas...
Print a golden spiral with Python's graphics library only. Do not use tinker, turtle or anything other than graphics.py.
J. E. Maxfield proved following theorem (see DOI: 10.2307/2688966):
If A is any positive integer having m digits, there exists a positive integer N such that the first m digits of N! constitute the integer A.
Challenge
Your challenge is given some A find a corresponding N (in base 10).
De...
Your puzzle is to create a working PHP proxy in as FEW bytes as possible.
the rules:
the URL is to be in this form: www.proxy.xyz/proxy.php/?url=www.this_site.net
It is up to you how to go about this.
Bob got kidnapped and is stuck in a maze. Your job is to help him find a way out. But since it is a very dark and scary maze, he can't see anything. He can only feel walls when he runs in to it, and knows when he has found the exit, but doesn't know anything more that.
Since he has to run your p...
