0
Following the feedback on this meta-post and some more feedback I got through chat, I am writing this post to lay down all the rules for the RGS I will be hosting.
RGS
RGS stands for RGS's Golfing Showdown, a golfing competition.
The format
The RGS will be a golfing competition with 5 code-go...
I proposed this code golf on sandbox:
Integer Logarithm
Take \$a \in ℤ_{>1}\$ and \$b \in ℤ_+\$ as inputs. Write a function \$f\$ that:
$$
f(a,b) =
\left\{
\begin{array}{ll}
\text{Just} \space \log_ab & \quad \text{if} \space \log_ab \in ℚ \\
\text{Nothing} & \qu...
Write a program that when given a string \$S\$, it generates a program of the same language as itself.
The generated program, when given a continuous substring of \$S\$, should predict the next character in an occurence of the subtring in \$S\$. You are guaranteed that this substring occurs exac...
Hello, World, but looong
I couldn't find out that this challenge exists
If this challenge exists, let me know
Write a simple Hello, World! program.
The winner is the person who has the longest code.
However, any subsequence except itself cannot be the answer.
Input
You can have input i...
APL
… is not a golfing language.
That said, some APL implementations, like NARS2000, feature arbitrary-length integers. Others, like Dyalog APL, have a library that provides this functionality. Additionally, some APL derivatives, like J, do too.
Task
Given the x,y coordinates (coordinates are guaranteed to be integers) of the vertices of two simple polygons in clockwise or anti-clockwise order. Output a Truthy value if both the polygons are similar otherwise a Falsey value
Testcases
Input
[(0, 0), (1, 0), (1, 1), (0, 1)] # Blue P...
