This used to be an old Computer Olympiad Question, not sure what the actual source was.
Assume function f:
f(1) = 1
This f(1), f(2), f(3), f(4), ... sequence of numbers are in ascending order.
Number n has been repeated f(n) times
Here is the sequence up to the fifteenth number:
n : 1 2...
Introduction
Most code-golfers here add explanations to their submissions, so it's easier to understand what's going on. Usually the codelines go on the left and the corresponding explanation to the right with some kind of separator. To make it look pretty, the separators are all on the same col...
What if we had to write code that calls a function, let's call it f(), but the actual executed function is not the one we originally called because it has been overwritten, but not overriden (ie. using inheritance is banned)...
Consider the following C program:
int main() {
return f();
}
i...
A sturdy square (akin to a magic square) is an arrangement of the integers 1 to N2 on an N by N grid such that every 2 by 2 subgrid has the same sum.
For example, for N = 3 one sturdy square is
1 5 3
9 8 7
4 2 6
because the four 2 by 2 subgrids
1 5
9 8
5 3
8 7
9 8
4 2
8 7
2 6
all sum to ...
