Many Languages, One Task
Your task is to make a single program that runs in as many languages as possible. Given a number n, your program must print its own source code, shifted by n.
Shifting
To shift a string by n, you must add n to the ASCII codes of its characters and take that as a string...
Create two programs in any two (not necessarily distinct) languages. Either program, given a character, should output how many times said character appears in the other program. A language is counted as a dialect or a language of its own, but not a version.
Rectangles have this nice property - an \$n \times m\$ rectangle consists of exactly \$n \times m\$ characters!
A.. more interesting property is that the rectangles can be aligned nicely in a multiplication table - for example, a \$3 \times 3\$ table:
# ## ###
# ## ###
# ## ###
# ## ###
# ## ...
500 rep for outscoring in Multiply with restricted operations
The current best score is 22 operations.
itx = 1/(1+a+b) #4
nx = -1/(itx+itx) #4
c = -( 1/(itx + itx + 1/(1+nx)) + 1/(1/(a+nx) + 1/(b+nx)) ) #14
Try it online!
I'll give 500 rep to the first better score, that is 21 operat...
well... until the association bonus comes in, that is... :P
Anonymous
@EriktheOutgolfer Correct. The 10k network rep privilege for seeing chat flags does not count association boni. Neither does the 20 rep privilege for talking in chat, though it doesn't matter for that one.
Background
Though this is a bit late for Pi Day, I saw an article about Pilish and thought it would make a great challenge. Pilish is created by using a sequence of words where each word's length corresponds to a digit of pi.
Example from Wikipedia:
The following Pilish poem (written by Jos...
Project author on trying to generate vote counts: "Unfortunately, after working on this for about a week straight I've come to the conclusion that there is no correlation between question content and upvotes/views."
CMC: find the smallest prime number p>2 such that {1,2,3,4,5,6,7,8,9,10} are all quadratic residues mod p (i.e. there is x such that x^2%p == n%p for n=1,2,3,4,5,6,7,8,9,10)
So, you have a random list (random meaning it doesn't matter what order it is in) of numbers with a length of n, where n is a positive integer smaller than 1000 and larger than 1.
The random list must contain every number from 0 to (n - 1). Eg: [0, 3, 2, 5, 1, 4] (where n is 6).
Your task is to...
Many Languages, One Task
Your task is to make a single program that runs in as many languages as possible. Given a number n, your program must print its own source code, shifted by n.
Shifting
To shift a string by n, you must add n to the ASCII codes of its characters and take that as a string...
Rectangles have this nice property - an \$n \times m\$ rectangle consists of exactly \$n \times m\$ characters!
A.. more interesting property is that the rectangles can be aligned nicely in a multiplication table - for example, a \$3 \times 3\$ table:
# ## ###
# ## ###
# ## ###
# ## ###
# ## ...
500 rep for outscoring in Multiply with restricted operations
The current best score is 22 operations.
itx = 1/(1+a+b) #4
nx = -1/(itx+itx) #4
c = -( 1/(itx + itx + 1/(1+nx)) + 1/(1/(a+nx) + 1/(b+nx)) ) #14
Try it online!
I'll give 500 rep to the first better score, that is 21 operat...
Background
Though this is a bit late for Pi Day, I saw an article about Pilish and thought it would make a great challenge. Pilish is created by using a sequence of words where each word's length corresponds to a digit of pi.
Example from Wikipedia:
The following Pilish poem (written by Jos...
So, you have a random list (random meaning it doesn't matter what order it is in) of numbers with a length of n, where n is a positive integer smaller than 1000 and larger than 1.
The random list must contain every number from 0 to (n - 1). Eg: [0, 3, 2, 5, 1, 4] (where n is 6).
Your task is to...
