Objective
Write a program that outputs some printable ASCII characters. The trick is that if the program is reversed byte-by-byte, it must output the same thing in the reverse order, byte-by-byte, too.
Rules
No standard loopholes.
The program must not be a palindrome, nor can it be 1 byte in ...
Proton, 21 bytes
a=>'print(%r)'%a
Try it online!
needs a pull from TIO before this will work online, but you can check the GH repository.
Your challenge is to print x digits of pi where x is your code length.
Examples:
Source code (length) -> output
foo (3) 3.14
foobar (6) 3.14159
kinda long (10) 3.141592653
+++++ (5) 3.1415
123456789 (9) 3.14159265
You can use floor(π...
Literally print a Polyglot
code-golf polyglot
Your Task
Write a program that outputs Poly when executed in the first and glot when executed in a second language of your choice. Obviously the first and second language can't be identical.
Input
None!
Output
Either, Poly or glot.
Rules
Thi...
Introduction:
Inspired by both Perfect License Plates and How many points does my license plate give?
Just like in the challenges above, me and my little brother had a game of our own with license plates as kids. We tried to create (random/funny) sentences with the (numbers and) letters of the ...
Perl 6, 48 bytes
{my$g=$^a gcd$^b;{$a*$_/$g,$b/$_}(($a/$g)gcd$g)}
Try it online!
Hasn't anyone noticed that there's a simple closed formula? With
g = gcd(a, b)
B = gcd(g, a/g)
a valid result is
c = a * B / g
d = b / B
-1
3
Your challenge today is to output a given term of a sequence ennumerating all of the integers. The sequence is as follows: If we have a 0-indexed function generating the sequence f(n), then f(0) = 0; abs(f(n)) = ciel(n/2); sign(f(n)) is positive when nand ciel(n/2) are either both even or both od...
Anonymous
