Skip to content

Comment on International Obfuscated Python Code Competition: Submissions Open

Comments

    import sys
    def c(j,t):
     sys.stdout.write(j('.')('P'))
     return t
    (lambda z:lambda y:z(z(y(lambda p:lambda n:(lambda s:lambda z:z(lambda x:
    lambda y:y)(lambda d:p(s)(y(s))(d)))(lambda x:lambda a:lambda s:lambda p:
    p(a)(lambda y:s(n(x))(y))))(lambda c:lambda a:lambda s:z(lambda y:s(c)(y)
    ))))(y(lambda p:lambda b:lambda t:t(c(b,p)))))(lambda s:lambda p:p(lambda
    x:lambda y:x)(s))(lambda f:(lambda q:q(q))(lambda x:f(lambda y:x(x)(y))))
Guess the pattern of Ps in the output (probably need to redirect stderr to /dev/null)

Any tip for setting Python's recursion limit before running it?

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.