When understanding how primitive operators such as +, -, * and / are implemented in C, I found the following snippet from an interesting answer.
// replaces the + operator
int add(int x, int y) {
while(x) {
int t = (x & y) <<1;
y ^= x;
x = t;
}
return y;
}
S...
3
Random
Build a full function or program which will return a random number from min to max, while min and max are positive integers, so the return should be too. Examples:
Input | Output
1, 3 | 1, 2 or 3
1, 5 | 1, 2, .. or 5
3, 6 | 3, 4, 5 or 6
The only rule is Don't use any build in functi...
I've just had a number of 'too chatty' comment flags declined, and I'd like to clarify what the mods here consider too chatty before I continue flagging.
This is the text of each of the comments that I've had a flag declined on:
+1, great use of eval and * '+'
+1 for the "farthest in n seconds...
Python 2, 44 bytes
f=lambda n,j=1:j/9*j*(j/9*j%n<1)or f(n,j*10)
When j is a power of 10 such as 1000, the floor-division j/9 gives a number made of 1's like 111. So, j/9*j gives 1's followed by an equal number of 0's like 111000.
The function recursively tests numbers of this form, trying hig...
Highly composite numbers
code-golf number number-theory arithmetic
A highly composite number is a positive integer that has more divisors than any smaller positive integer has. This is OEIS sequence A002182. Its first 20 terms are
1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 720, 840, 1...0
Repeatedly convert from minimal base to base 36
fastest-codebase-conversionrepeated-transformation
Your task is to convert an input string from the lowest possible base to base 36, repeatedly, until there is no further change to be made.
Rules:
You may not use base conversion builtins.
From ...
Find the haystack in the needles
In a twist on finding a needle in a haystack, you need to find the largest contiguous haystack containing exactly one needle. Note that you cannot connect cells on diagonals, only left/right/up/down.
Input
An array (or a number of user input lines, your pick) o...
Given an input of a program written in oOo
CODE, output the BF code that it
represents.
Here is a short description of how oOo CODE works:
First, all non-alphabetic characters are removed (everything not in the range
A-Za-z).
For example, take the program PROgRam reVERsES giVeN iNPut sEqUENcE...
