c="(()()()()())({({})({}[()])}{})"
s=[[],[]]
def w():s=s[::-1];return 0
def p(c):global s;i=eval(c);s[0].append(i);return i
def n(c):return eval(c)*-1
def z(c):exec(c);return 0
def l(c):
i=0
while s[:][0][-1]:i+=eval(c)
return i
r=str.replace;c=r(r(r(r(r(r(r(r(c,"()","+1"),"[]","+s[i].len()"),"{}","+s[i].pop()"),"<>","+w()"),"(","+p("),"[","+n("),"{","+l("),"<","+z(")
for i in "}]>":c=r(c,i,")")
print(c)
A friend of mine gave me this problem:
Input:
An integer X which is <= 100
Output:
Total combinations of 2, 3, and 5 (repetition is allowed) which sum is equal to X.
Examples:
Input: 8
Output: 6, because the valid combinations are: 3+5, 5+3, 2+2+2+2, 2+3+3, 3+2+3, 3+3+2
Input: 11
Output:...
Esolang Imposter!
Choose an esolang in which to compete, call this language Language A.
Next, attempt to emulate another esolang, call this language Language B, using Language A.
To "emulate" another programming language you must, at minimum, implement at least 10 bytes from their codepage....
Take advantage of the 'Stack-Height' nilad
Especially in kolmogorov-complexity challenges, or challenges where you always know the size of the input, you can take advantage of the 'Stack-Height' nilad [] to create integers.
Let's work through this with a hypothetical challenge: output CAT. The ...
