Captcha Capture
image-processing test-battery parsing
Captchas aren't meant to be machine-readable, and that's terrible. It is time to end this obvious bout of unfounded hatred for machines just trying to let you know about great deals on ṗḧ@ṛḿ4ćëüẗ1ċäḷṡ ƻđȺɏ.
Note: All captchas were made by u...
Shortest substring to guarantee an error
code-golf
(Other tags TBD)
Find the shortest possible string in the language of your choice which cannot be part of any valid program that runs without erroring (i.e. with an exit code of zero). Additionally, each character in your string must be allowed...
The challenge is to find a string of characters that cannot appear in any legal program in your programming language of choice. That includes comments, strings, or other "non-executable" parts.
Challenge
Your program may be specific to a particular version or implementation of your language's ...
JavaScript, 17 bytes
x=>x.toString(16)
Y'all using your fancy esolangs to golf everything. Looks like JavaScript can catch up though, heck it even tied with APL!
0
My name is Eduardo and I'm a Computer Science student from Brazil, finishing college by the end of this year. My undergraduate thesis is about the programming language JAEL that I'm developing for Code Golf challenges. The source code and documentation are available at GitHub and an interpreter i...
I need an assembly language program that loops until it reads a top value of zero. On each looping, it asks the user for a number n, which is assumed to be positive, and prints out the sum of the 1st n integers
Generate some rough numbers
number-theorycode-golf
Background
A number n can be described as B-rough if the prime factors of n strictly exceed B.
The Challenge
Given two positive integers B and k, output the first k B-rough numbers.
Examples
Let f(B, k) be a function which returns the se...
Game of Lives
king-of-the-hill cellular-automata game-of-life
In this king-of-the-hill, your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time...
Challenge 2 - Which major scale is this
This is a continuation of the previous challenge Is this a Major Scale (or equivalent)
As we saw in the previous challenge, we have 7 notes C, D, E, F, G, A, B. All of them can be increased a semitone using the sharp symbol # or decreased a semitone using...
Implement LogiMuxi
The language
LogiMuxi is, as its name suggests, a programming language based on multiplexers.
Built-in gates
M(A,B,C) (Multiplexer): If A is 0, returns is B, otherwise returns C.
R() (Random): Returns either 0 or 1 uniformly randomly.
I() (Input): Reads a bit from STDIN an...
Problem A3 from the 2008 Putnam competition says:
Start with a finite sequence \$a_1, a_2, \dots, a_n\$ of positive integers. If possible, choose two indices \$j < k\$ such that \$a_j\$ does not divide \$a_k\$, and replace \$a_j\$ and \$a_k\$ by \$\gcd(a_j, a_k)\$ and \$\text{lcm}(a_j, a_k)\$...
