Task Given a letter (A, B, C), and a number (0-10), output the size of the matching standard paper size (Series A and B) or the matching standard envelope size (C series) in millimetres in the format aaaa x bbbb where aaaa and bbbb are the width and height measurements in millimetres as per ISO2...

Clear the centrally significant on bits code-golf binary Related and inspired by. Input Input is a single positive integer n. Output It's easiest to describe this by example. n = 433 Take n's binary representation. bin(n) = 110110001 Note which bits are on. 110110001 ^^ ^^ ^ Set...

Shortest Path Distance Uh oh! You want to get to the point (10,10) from the origin, but there are a whole bunch of boxes in the way! What is the length of the shortest path which avoids all of them? Input Your program should take a set of rectangles, defined by the coordinates of two opposite ...

Regarding this suggested crack, do I have to accept it as valid? The code there is not valid 6502 machine code because it uses an opcode that doesn't exist (and won't work / crash on CMOS variants of the 6502 processor family). But it works correctly on all NMOS variants, and there wasn't ever a...

Bring an end to the Vigil Vigil, being the supreme moral paragon of programming languages, inspires us all to write bug-free code without exceptions through supreme medieval punishment. However, every hero has their weakness, and Vigil's weakness is on line 98: except: print("Vigil has fai...

Mathematical Background We have a matrix equation, Ax = b where A is an N by N real matrix, x is a vector of N unknowns and b is a vector of N known real numbers, with N > 1. Jacobi's method is as follows: If A = D + R where D is the matrix of diagonals and R the remainder then make a guess x, ...

Mathematical Background Let A be an N by N matrix of real numbers, b a vector of N real numbers and x a vector N unknown real numbers. A matrix equation is Ax = b. Jacobi's method is as follows: decompose A = D + R, where D is the matrix of diagonals, and R is the remaining entries. if you mak...

Implement simplified kerning code-golf grid Introduction Kerning means adjusting the spacing between the letters of a text. As an example, consider the word Top written with the following three glyphs: ##### ..... ..... ..#.. ..... ..... ..#.. ..##. .###. ..#.. .#..# .#..# ..#.. .#..# .#..#...

An EAN-8 barcode includes 7 digits of information and an 8th checksum digit. The checksum is calculated by multiplying the digits by 3 and 1 alternately, adding the results, and subtracting from the next multiple of 10. For example, given the digits 2103498: Digit: 2 1 0 3 4 9...

BCD difference Given an integer n, convert it to BCD (binary-coded decimal) 234 -> 0 0 1 0 0 0 1 1 0 1 0 0 Then rotate the list of binary digits in order to find the largest and smallest numbers, representable by this list without other rearrangements. max: 1 1 0 1 0 0 0 0 1 0 0 0 min: 0 0...

Make me an icecream cone please .-@@-. (======) (--------) (==========) (__________) \/\/\/\/\/ \/\/\/\/ \/\/\/ \/\/ \/ GOAL Output the above icecream cone exactly. (or return it from a function) This is code golf so shortest answer wins

Your challenge is to decode substitution ciphers applied to sentences from 'Alice's Adventures in Wonderland'. Each sentence has been reduced to lowercase, and all non-alphabetic characters have been stripped. You will first receive 2000 sentences by stdin (or any other appropriate method), eac...

A farmer wants to cross a river and take with him a wolf, a goat, and a cabbage. There is a boat that can fit himself plus either the wolf, the goat, or the cabbage. If the wolf and the goat are alone on one shore, the wolf will eat the goat. If the goat and the cabbage are alone on the shore...

It is well known that a person on a grid under the influence of alcohol has an equal chance of going in any available directions. However, this common-sense statement does not hold in the realm of very small drunkards, whose behavior is very much as if they take every available path at once, and ...

Smallest Proth Prime Power A Proth Prime is a prime number of the form (k*2^n)+1. The Challenge Given a positive integer k, return the smallest non-negative integer n such that (k*2^n)+1 is a prime. This is code-golf, so smallest answer in bytes will win! OEIS link for this sequence OEIS li...

Background In C, there is a function to help parse command-line arguments: getopt. Getopt takes the argument count (argc), the argument list (argv), and a string representing the options the program should take (optstring). The option string (optstring) is a series of option characters each fo...