aaronryank

Bash

echo 404

Try it online!

Foo

echo "404"

Subtract and branch if less than or equal to zero (SUBLEQ)

Subtract the contents of address a from the contents of address b, store the result in address b, and if the result is non-positive, transfer control to address c. If the result is positive, execution continues to the next instruction in the code. So subleq a, b, c would be equivalent to:

mem[b] -= mem[a];
if (mem[b] <= 0)
    goto c;

A variant of subleq is subneg, which is equivalent to subleq except instead of mem[b] <= 0 it performs mem[b] < 0.

Brainf**k or most of its derivatives
Bitwise Cyclic Tag
Cyclic Tag
Three Star Programmer which is incidentally a OISC itself
A few OISCs here
ResPlicate - difficult to understand, less difficult to implement

	use Text::ParseWords;

	print "typedef void *UNTYPED;\n";
	print "#define ARGS UNTYPED args[]\n";
	print "#define INT __uint128_t\n";
	print "#define STR char *\n\n";

	my @variables;
	my $variable_count = 0;
	my @code;

	#!/usr/bin/env bash

	read -p "Function return type: " val
	if [ "$1" != "mini" ]; then
	read -p "Function name: " name
	fi
	read -p "Function argument list: " list

	echo "$val $name($list) {" >f.c
	echo "Enter code:"

	1 ;#
	1 ABAP
	1 ACL2
	1 A Pear Tree
	1 ASM
	1 Awk
	1 Babel
	1 BaCon
	1 Bob
	1 Ceylon

	#!/usr/bin/env bash
	# Downloads all OEIS sequence lists and formats them into C arrays

	for i in `seq 1 296700`; do
	printf -v s "A%.6d" $i
	echo $s >/dev/stderr
	echo -n "long long int $s[] = {"
	wget -qO- https://oeis.org/$s/list \| tr -d '\n' \| sed 's/^.*<pre>/<pre>/' \| cut -c 7- \| cut -f1 -d"]" \| tr -d '\n'
	echo "};"
	done

	#!/usr/bin/env bash

	# test internet connection
	wget -q --spider http://google.com

	if [ ! $? -eq 0 ]; then
	echo "No internet connection, exiting..."
	exit $?
	fi

	#include <stdio.h>
	#include <stdlib.h>
	#include <string.h>
	#include <stdint.h>
	#include <limits.h>

	// Sort it like a human!
	// O(2n)
	void humansort(int **list, int size)
	{