Questions tagged [code-challenge]

Question 1

Given a wall maze of 50x50, exactly same generating algorithm, at different RNG, so every two positions are connected by exactly one path, etc. Write two functions: One takes the maze as input and ...

Question 2

Given a wall maze of 50x50, write two functions: One takes the maze as input and returns a positive integer; The other takes the integer and walk through the maze from left-top to right-bottom. At ...

Question 3

Here is a game: Start with the set {1,2,3,...,n} of natural numbers. At any turn of the game, you may pick two numbers from this set, a and b, then replace them with their product a*b. Since it is a ...

Question 4

Write a program with the following properties: it must be a quine, i.e. running it outputs precisely the program itself; it must take no input; for at least one integer k, it must be the case that ...

Question 5

from Latexmk: If you use cross-references, you often have to run LaTeX more than once ... Sometimes cross-referenced locations change and you need to run LaTeX again to create the correct reference. ...

Question 6

Challenge You must produce an infinite sequence of programs \$P_0, P_1, P_2,\$ … such that each program \$P_n\$, when run, prints the exact source code of \$P_{n+1}\$ and then halts. Each program \$...

Question 7

I am interested in the following problem: What is the minimum number of distinct characters used in any programming language that can implement Boolean Algebra? In particular, what is the set that ...

Question 8

Challenge We define a Minsky machine as a program made of the following two instructions: +X which increments the register X and continues to the next instruction -Xn which simply continues if X is ...

Question 9

CHALLENGE This problem has a math background. For n=1,2,3,4 we want to count the number of families of sets with maximum n elements that satisfy many criteria of the form: $$\bigoplus_{k\in A,A\in \...

Question 10

You are in charge of running a board game tournament. Unfortunately, you only have one copy of the game and only so much time, so only a limited number of games can be played. Similarly, you have a ...

Question 11

The task is to find parameters that make a fast leap year check correct for the widest range of years. We assume the Proleptic Gregorian calendar, which extends the Gregorian calendar backward from ...

Question 12

Goal Input is a Brainfuck program for 8 bit cells, output it for 1 bit cells. Explanation We all know Brainfuck, normally it uses 8 bit cells. But there are implementations where a cell is just 1 bit, ...

Question 13

Output \$20\$ float64s with absolute value between 1 and 2 inclusive whose sum has the largest possible relative error. We can assume the true sum is not zero. The sum is to be computed from left to ...

Question 14

Input Integer \$n > 1\$ Output Ten 64 bit floating point numbers between \$-n\$ and \$n\$, inclusive, whose sum is the least accurate. Details and examples. These examples are not claimed to be ...

Question 15

Introduction This is a small challenge I came up with while trying to make some compact code for my younger brother to use. I don't think it's particularly interesting, but I believe it presents some ...

Stack Exchange Network

Questions tagged [code-challenge]

Through maze with a compressed guide

Through maze with a hint

Cancel and minimize game

Error-Detecting Quine

Unstablizable LaTeX

Sequence of programs that prints the next one with length growth being equal to π

How many distinct characters can be used to implement Boolean Algebra in your programming language [closed]

Long running section 11.4 Minsky machine

Count number of families of sets satisfying a list of criteria

Run a board game tournament

Fast leap year check

Convert 8 Bit brainfuck to 1 bit Brainfuck / Boolfuck

Largest possible relative error

Find 10 float64s that give the least accurate sum

Create the characters you can write on a MacOS US English Keyboard (as another OS will read them)

Hot Network Questions