i feel like i'm almost done with this.
#esoteric-python
brisk zenith
holy fuck i think it's done
reverse_polish = lambda expression: ((lambda PolishStack, split: ((lambda stack: tuple(stack.push(float(item)) if item.isdigit() else stack.operate(item) for item in split(expression)) and stack.pop())(stack=PolishStack())))(PolishStack = type("Stack", (), {"__init__": lambda self: (setattr(self, "_tuple", ())), "push": lambda self, item: (setattr(self, "_tuple", (item, *self._tuple))), "pop": lambda self: ((lambda tmp: tmp.add(self._tuple[0] if self._tuple else None) or setattr(self, "_tuple", self._tuple[1:]) or tmp.pop())(set())), "operate": lambda self, operator: ((lambda operation: self.push(operation(self.pop(), self.pop())))(operation = {"+": float.__add__, "−": float.__sub__, "÷": float.__truediv__, "×": float.__mul__}[operator]))}), split = lambda string: ((lambda spaces: (string[start:end - 1] for start, end in zip((0, *spaces), spaces)))(spaces = tuple(index + 1 for index, char in enumerate(string) if char.isspace())))))```>>> reverse_polish("15 7 1 1 + − ÷ 3 × 2 1 1 + + −")
4.0
>>>
@frosty wyvern one statement :D
fallen heath
damn
brisk zenith
wait it isn't correct
this is disappointing, it's supposed to equal 5 there i believe.
fallen heath
I have a version i quickly put togheter that for now only works with single digit numbers
a={}
for c in map(lambda b:b.isdigit() and (a.update({len(a):b}) or True) or b==" " or a.update({len(a)-2:eval(a.pop(len(a)-1)+b+a.pop(len(a)-1))}), "1 3 +"): pass
print(a[0])
you can compress that a bunch already, though i am impressed that you managed to use a dict like that.
brisk zenith
the problem about my code is that i have no fucking idea where the bug is occurring :P
like yes i totally know exactly where that <generator object <lambda>.<locals>.<lambda>.<locals>.<lambda>.<locals>.<genexpr> at 0x7fdedf8f3660> is.
:D
yeah i figured it out, i wasn't doing the last operation and i got my operands mixed up.
reverse_polish = lambda expression: ((lambda PolishStack, split: ((lambda stack: tuple(stack.push(float(item)) if item.isdigit() else stack.operate(item) for item in split(expression)) and stack.pop())(stack=PolishStack())))(PolishStack = type("Stack", (), {"__init__": lambda self: (setattr(self, "_tuple", ())), "push": lambda self, item: (setattr(self, "_tuple", (item, *self._tuple))), "pop": lambda self: ((lambda tmp: tmp.add(self._tuple[0] if self._tuple else None) or setattr(self, "_tuple", self._tuple[1:]) or tmp.pop())(set())), "operate": lambda self, operator: ((lambda operation: self.push(operation(*(self.pop(), self.pop())[::-1])))(operation = {"+": float.__add__, "-": float.__sub__, "/": float.__truediv__, "*": float.__mul__, "^": float.__pow__}[operator]))}), split = lambda string: ((lambda spaces: (string[start:end - 1] for start, end in zip((0, *spaces), (*spaces, len(string) + 1))))(spaces = tuple(index + 1 for index, char in enumerate(string) if char.isspace())))))
this is the working code now. (for #challenge1)
pure dew
wow
brisk zenith
the operators from the input are some weird unicode things, but those are what's used in the examples provided so i'm using them.
(like ÷×−)
(and you can see the expanded/commented code here: https://paste.pythondiscord.com/ujuduzizif.py)
brisk zenith
thanks :D
pure dew
now do it with lisp
brisk zenith
now go away
arctic bridge
Welcome to the club Shawn
brisk zenith
haha, lots of things.
frosty wyvern
That is, absolutely amazing
also im sorry I didnt notice the example I copy pasted used weird symbols lmao
I guess it's part of the challenge now :^)
brisk zenith
lmao fair enough. im glad people find the code interesting c:
sick hound
k='*-/+^×−÷';v=b'\x14\0',b'\x18\0',b'\x1b\0',b'\x17\0',b'\x13\0';m=dict(zip(k,v*2));b=b'';e=d='';n=();x=0;s=lambda d,n:d in n and(n,n.index(d))or((*n,d),len(n))
for c in input()+' ':
if c.isdigit():d+=c
elif d:x+=1;n,i=s(int(d),n);b+=bytes((100,i));d=e
if c in m:b+=m[c];x-=1
x-1 and 1/0;f=lambda:0;f.__code__=type(f.__code__)(0,0,0,x,0,b+b'S\0',n,(),(),e,e,0,b);print(f())``` #challenge1m={'+':b'\x17\0','*':b'\x14\0','-':b'\x18\0','/':b'\x1b\0','×':b'\x14\0','−':b'\x18\0','÷':b'\x1b\0'} # map operators to python bytecode that executes that operator
b=b'' # code
d='' # number
n=() # consts
x=0 # number of numbers
o=0 # number of operators
def s(d,n): # search
try:return(n,n.index(d)) # get the index
except:return((*n,d),len(n)) # add it
for c in input()+' ': # add space to handle numbers at the end
if c.isdigit():d+=c
elif d: # end of a number
x+=1 # increment number counter
d=int(d)
n,i=s(d,n) # search for number in constants
b+=bytes((100,i)) # 100 = LOAD_CONST
d='' # reset the number
if c in m: # operator
b+=m[c]
o+=1 # increment operator counter
x-o-1 and 1/0 # if x-o-1 is not 0 then the expression is broken, raise an error
f=lambda:None
f.__code__=type(f.__code__)(0,0,0,x,0,b+b'S\0',n,(),(),'','',0,b'') # create a code object
print(f()) # execute the code object``` ungolfed explained versionyes, lambdas for days
sick hound
(i've golfed it a bit more now)
brisk zenith
nifty
brisk zenith
when will the repo for archiving the challenge submissions be made?
frosty wyvern
Oh I made a github repo, I'll put these up in a jiffy
These are beautiful
Unless you guys wanna make PRs into it but it sounds like too much work
brisk zenith
it's up to you, i don't mind.
sick hound
^
brisk zenith
i just edited mine so it works with *+/- rather than the unicode examples
i could also make it allow ^ for power and whatnot, actually.
there we go.
>>> reverse_polish("9 5 3 + 2 4 ^ - +")
1.0
>>>
Pastebin what do you want your name to be I'll credit it in the file
sick hound
"pastebin"
frosty wyvern
oki c:
sick hound
also i've updated mine to allow ^ for power too
frosty wyvern
Quantum what do you want your credited name to be
brisk zenith
who me?
brisk zenith
oh, i'll be "juan (kingdom5500)" if you don't mind c:
frosty wyvern
https://github.com/shawnmcla/python-discord-challenges-archive/tree/master/submissions/challenge1
The two submissions so far are in here 😃
don't look at my repos it's a graveyard
brisk zenith
can mine be renamed to juan.py please 👀
frosty wyvern
oyea mb
brisk zenith
thanks :D
frosty wyvern
I'm so lazy that I'm creating/editing the files directly on the Github website
frosty wyvern
That'd be great cause I have no clue how yours works 😄
brisk zenith
i posted a link for it but it's an older version, so lemme do it again.
https://paste.pythondiscord.com/hevaveqifa.py @frosty wyvern i believe this is correct.
frosty wyvern
this is beautiful
frosty wyvern
and I mean that in the most atrocious of ways
wind maple
You can get around the no lists limitation by using a deque
frosty wyvern
nooo no imports
brisk zenith
yes just don't import it too hard :^)
wind maple
oh heck imports 🤔
frosty wyvern
# through its parameters, such as an entire Stack class.``` lmaolmao
i was debating on declaring the stack class as a default argument in the function definition, but /shrug
i hope the comments there make it somewhat readable :P
frosty wyvern
yeah haha, tho im learning some things by reading it, like the way you declared the class 😛
brisk zenith
haha
frosty wyvern
f u n c t i o n a l
brisk zenith
"push": lambda self, item: (
...
)
is the same as
def push(self, item):
...
yeah, makes sense
didnt realize you could create classes with type()
though I think Ive seen it but its not something I retained cause
why
brisk zenith
yeah, that's how metaclasses control how classes are made
sorta
type is a metaclass, i mean.
brisk zenith
i only touched on them yesterday
viral hedge
The same way i did
brisk zenith
yes, that's a good skill that most people don't have
viral hedge
By being helpful
brisk zenith
exactly
frosty wyvern
I mean I also understand programming concepts, but im not all that familiar with python's inner workings or its stdlib 😃
Most of my experience comes from other languages like C# and JS
shudders
brisk zenith
pastebin's code submission is actually really cool once you understand it.
frosty wyvern
I still have to look at that one
brisk zenith
it constructs the cpython bytecode required to evaluate the expression given, then turns that bytecode into a function which is then executed.
frosty wyvern
wtf
brisk zenith
yeah it's a really cool idea.
frosty wyvern
I retire
brisk zenith
+1 to @sick hound
frosty wyvern
How did you devise this solution
brisk zenith
both me and pastebin have spent (perhaps too much) time fucking with cpython bytecode
so it doesn't surprise me that this is the solution he's submitted haha
brisk zenith
funsies
did you see my project that creates a function decorator to make C++'s cin and cout syntactically correct in python?
sick hound
using cpython's built-in stack avoids creating a stack without lists :)
brisk zenith
yeah, that's really smart.
frosty wyvern
brillian
brisk zenith
the call stack and whatever.
brisk zenith
haha, well this is the sort of stuff i do when i have nothing better to do. :D
sick hound
i wonder if you can make a reverse polish notation evaluator using the call stack as the stack
brisk zenith
you could if you push the float.__add__ etc. functions
and also push the values as well.
sick hound
hmm
brisk zenith
in the right order.
i imagine
though it would be quite tricky without clobbering the actual call stack, actually.
sick hound
i have an idea
pure dew
pastebins code doesnt work on my machine
brisk zenith
you'll need a specific version of python, probably
pure dew
so not micropython?
brisk zenith
nope, it relies on the cpython implementation :P
and a fairly recent one at that, i believe
pure dew
i cant imagine how i'd install micropython on my laptop tho
brisk zenith
oh by the way, i think we should show some appreciation for @frosty wyvern for organising this little event thing :D
frosty wyvern
Oh you 😉 Y'all set the bar too high no one else is gonna enter now
brisk zenith
hey, i don't see why other people can't give this challenge a little go. @fallen heath is currently working on a simple solution to this and i feel like other people should be doing something like this too. you don't have to use wacky concepts to have a good submission.
frosty wyvern
I should probably try to tackle my own challenge eh
brisk zenith
yes shawn, do it :D
frosty wyvern
I'm a simple man, I see a challenge and I skedaddle
brisk zenith
very well
shy vector
hi uh
copypasting thing ehre
currently we've got 100 characters
over at the challenges discord server
if you get a shorter one i'll copypaste it over
frosty wyvern
im so bad at golf lmao, ive never done any type of code golf
i made a stack class but its not as cool as yours juan lol
class s:
def i(s,v):s.s=(v,)
def m(s,v):s.s=(*s.s,v)
def p(s):t=s.s[-1];s.s=s.s[:-1];return t
literally just a minified class
😦
brisk zenith
haha, it works in exactly the same way though, so that's nifty.
frosty wyvern
im debating adding the init method
brisk zenith
except your stack pushes onto the end of the tuple, mine pushed onto the beginning.
frosty wyvern
right now i do s().i()
but idk how many times id create a stack
prob once so
i save characters
wee
though the annoying thing about using actuaal constructs like class and def is that syntax is stricter
brisk zenith
i could have done py type("Stack", (), {...})() to initialise mine immediately but i didn't
frosty wyvern
but anywho, gotta start somewhere
I guess there's no point trying to come up with the smallest thing from the start, i should build then try to shave where i can
since I'm new to this golf thing ;p
brisk zenith
that's what i do when creating functional programs, sorta.
i make the full thing without the functional paradigm, then i slowly turn it more and more into hell afterwards
frosty wyvern
LOL
brisk zenith
although actually, i didn't do that in this case.
shy vector
by the way we're still at 100 chars
brisk zenith
i sorta wrote it with lambdas from the get-go
frosty wyvern
oh juan i wanna see you wreck that one gogogo
brisk zenith
haha, making that functional would be fun but i don't really know anything about chess so /shrug
shy vector
basically if you have a position (2,3)
with the knight you can move either 1 slot u/d 2 slots l/r
or 2 slots u/d 1 slot l/r
frosty wyvern
yeah its simple Juan you dont need to know chess
brisk zenith
hm okay
frosty wyvern
😄
brisk zenith
so, should i make that functional then?
frosty wyvern
just make it mindbending.
brisk zenith
i have an interesting idea for that, actually.
frosty wyvern
Reading y'all's code is like consciousness expanding
brisk zenith
first thing that comes to mind is a generator that makes lambdas haha
lemme see what i can do.
shy vector
frosty wyvern
LOOOOOOOOOL
brisk zenith
oh i see.
shy vector
values from (0,0) to (7,)
must take in 2 inputs somehow and print/return 2 values
must be either stdout or visibile in an IDE
such as replit and the lambda x=lam... ... ... x(0,2)
shy vector
kk
just for reference this is the shortest solution so far
n=range(8)
k=lambda a,b:[(i,j)for i in n for j in n if min(i!=a,abs(i-a)+abs(j-b)==3,a|b in n,j!=b)]
yikes
brisk zenith
knight_moves = lambda x, y: (
[(x, y) for x, y in (
func(x, y) for func in (
(
lambda x_offset, y_offset: (
lambda x, y: (
x + x_offset,
y + y_offset
)
)
)(x_offset, y_offset)
for x_offset in (-2, -1, 1, 2)
for y_offset in (-2, -1, 1, 2)
if abs(y_offset) != abs(x_offset)
)
) if (8 > x > 0) and (8 > y > 0)]
)
this generates a function for every possible move, calls each one, then filters the result. @frosty wyvern @shy vector :P
frosty wyvern
that makes me physically ill
brisk zenith
one thing i love about these single-statement codes is that the indentation doesn't matter at all
knight_moves = lambda x, y: (
[(x, y) for x, y in (
func(x, y) for func in (
(
lambda x_offset, y_offset: (
lambda x, y: (
x + x_offset,
y + y_offset
)
)
)(x_offset, y_offset)
for x_offset in (-2, -1, 1, 2)
for y_offset in (-2, -1, 1, 2)
if abs(y_offset) != abs(x_offset)
)
) if (8 > x > 0) and (8 > y > 0)]
)
true
barfs
Also I'm getting a division by zero error in my code and I have no clue why 😄
I guess I have to learn to use pdb now :))0
pure dew
oof
brisk zenith
my code as one line:
knight_moves = lambda x, y: ([(x, y) for x, y in (func(x, y) for func in ((lambda x_offset, y_offset: (lambda x, y: (x + x_offset, y + y_offset)))(x_offset, y_offset) for x_offset in (-2, -1, 1, 2) for y_offset in (-2, -1, 1, 2) if abs(y_offset) != abs(x_offset))) if (8 > x > 0) and (8 > y > 0)])
LOL
shy vector
golfed even more
a=lambda x,y:([(x,y)for x,y in(d(x,y)for d in((lambda b,c:(lambda x,y:(x+b,y+c)))(b,c)for b in(-2,-1,1,2)for c in(-2,-1,1,2)if abs(c)!=abs(b)))if(8>x>0)and(8>y>0)])
Actual footage of me trying to code golf
brisk zenith
pin this now.
shy vector
golfed even more
z=-2,-1,1,2;a=lambda x,y:([(x,y)for x,y in(d(x,y)for d in((lambda b,c:(lambda x,y:(x+b,y+c)))(b,c)for b in(z)for c in(z)if abs(c)!=abs(b)))if(8>x>0)and(8>y>0)])
ewwww two statements
frosty wyvern
cunning wave
trump is a python coder ? 🤔
brisk zenith
who said shawn was a python coder?
frosty wyvern
pure dew
Whoever it was talking about functional python, there's Coconut: http://coconut-lang.org/
Maybe we can have that as an option for these challenges too?
brisk zenith
@pure dew hey thanks, i'll take a look at that soon
i feel like i am getting better at creating functional python programs given the limitations of the python lambda by doing these sorts of challenges, so that's interesting.
wind maple
anyone want a code golf challenge
frosty wyvern
I mean we already have one going on :^)
wind maple
yeah I'm just interested in how far ppl here can push it
I don't like golfing but I like the solutions other people make
brisk zenith
can i make a functional solution instead? :D
frosty wyvern
same
I love any kind of creative coding
whethter its golf or functional atrocities
wind maple
anyway
Fractal
Let's observe the fractal F_n, which is defined in the following way recursively:
- Fractal F_1 is a 1x1 -grid, which has one black square.
- Fractal F_k (when k > 1) is obtained by arranging four fractals F_k-1 as a square and inverting the colour of the bottom-right square.
For example F_4 looks like the following:
########
#.#.#.#.
##..##..
#..##..#
####....
#.#..#.#
##....##
#..#.##.
Your task is to form the fractal F_n```Can we pin that coconut link and allow it for these challenges?
brisk zenith
ooh that looks interesting ava.
i'm gonna try to make a functional solution for it.
frosty wyvern
whew im pretty much done my RPN golf
brisk zenith
yes good :D
frosty wyvern
Eh it's alright I guess
It's much less Arcane than yalls submissions :p
But there's a few limitations like the equation must be formatted perfectly no trailing or leading spaces and it only accepts the funky symbols found in "15 7 1 1 + − ÷ 3 × 2 1 1 + + −"
oshit hold on i can save like 4 bytes if i put the class outside the function
vague gust
hey shawn
frosty wyvern
hmmm fudge I need a line break between my class and a function
vague gust
can't i just spawn dc
frosty wyvern
what's dc
vague gust
vague gust
good question
frosty wyvern
now that's a fuyn challenge
vague gust
thank you bro
See if I can get a syscall to run
I can replace the current process with something
if I get access to execve i can tell python to replace itself with dc or whatever
frosty wyvern
Hmm, interesting, the Python repl complains about syntax but not if I run the script normally
vague gust
odd
brisk zenith
the channel topic should be updated btw. the last bit, i mean.
vague gust
done
frosty wyvern
class S:
def __init__(s):s.s=tuple()
def m(s,v):s.s=(*s.s,v)
def p(s):t=s.s[-1];s.s=s.s[:-1];return t
o=lambda z,x,y:{"+":x+y,"−":x-y,"÷":x/(y or 1),"×":x*y}[z]
def f(i):
n=r=0
s=S()
for c in i:
if c.isnumeric():n=n*10+int(c);r=1
elif c==' ':
if r:s.m(n);n=r=0
else:s.m(o(c,s.p(),s.p()))
return s.p()
here's my boring af solution
lol
brisk zenith
oh nice :D
vague gust
you had the oppertunity to spell out word 😔
frosty wyvern
oh LOL
brisk zenith
what
frosty wyvern
oh wait i found a few more byte saves
brisk zenith
you can do isdigit rather than isnumeric if you want it to work properly
and save more bytes too
frosty wyvern
sick hound
sys = next(c for c in object.__subclasses__()if'ModuleLock'in repr(c)).acquire.__globals__['sys']
os = sys.modules['os']```list ocmprehension tsk tsk
;p
NO LISTS.
oh wait
hahahahaha
lmaoooo
Golfing this was fun even though I used no real hacky things like the other two haha
frosty wyvern
:3
vague gust
>>> import ctypes
>>> libc = ctypes.CDLL(None)
>>> libc.syscall(39)
20809
so somehow i need to do this without importing ctypes
(39 is the getpid syscall btw)
cunning wave
write your own c stdlib
sick hound
(why can't you use os.getpid())
cunning wave
thats not esoteric enough
sick hound
(look at the way we get os)
vague gust
@sick hound interesting idea
sick hound
we can get os but not ctypes
frosty wyvern
Unless the following token starts with e or E. You can remove the space following a number.
For instance:
if i==4 and j==4:
pass
Becomes:
if i==4and j==4:
pass
interesting
brisk zenith
yup
frosty wyvern
well too bad that doesnt help my code 😃
brisk zenith
it can't begin with e or E because float literals 1e9 etc
sick hound
'numbers'or'strings' # i know the syntax highlighting looks weird but it works```yeah I get it, I just never thought that it would work without space
vague gust
tuples are allowed right?
brisk zenith
yes
sick hound
yes
vague gust
good good
sick hound
if tuples weren't allowed both of the existing solutions would break
brisk zenith
and there would be no practical solution other than using {0: first, 1: second, ...} dicts :P
vague gust
okay boys
s = next(c for c in object.__subclasses__()if'ModuleLock'in repr(c)).acquire.__globals__['sys']
o = s.modules['os']
e = input()
o.execve("/bin/dc", ("dc", "-e", e + " p"), {})
we did it
pure dew
oh, i think pastebin beat me to it, but mine is prettier
vague gust
brisk zenith
not multiplatform enough
frosty wyvern
LOL
vague gust
juan if they don't use linux they aren't worth it
frosty wyvern
wanna golf it a bit more before I put it in the submissions ;p
vague gust
yeah i will now
frosty wyvern
you guys are all geniuses
brisk zenith
i consider that cheating, but it is an interesting solution anyways haha :D
brisk zenith
of course ^-^
vague gust
hey it is not cheating it is just being rad
pure dew
i mean.. he did what the instructions said
vague gust
precisely
frosty wyvern
Creatively working around rules isn't really cheating shrugs
brisk zenith
sure :D
frosty wyvern
Anyways this is the kind of things I wanna see, how creative people get, it's inspiring 😄
Everyone is a winner except me
vague gust
the fun thing here is i am also not spawning a new process
i just LOVE the exec syscall
it's my best friend
you login using exec, you run things in your terminal using exec
everyone uses exec!
frosty wyvern
Doesn't know what exec does
vague gust
it replaces the running process with another one
frosty wyvern
ooo
vague gust
so in this case i switch python into a dc process
but when you run something in the terminal, the terminal forks itself (creates another process of itself) and then that process exec's into the command you want to run
frosty wyvern
ooooooo
vague gust
s=next(c for c in object.__subclasses__()if'ModuleLock'in str(c)).acquire.__globals__['sys']
o=s.modules['os']
e=input()
o.execve("/bin/dc",("dc","-e",e+" p"),{})
this is as golfed as I can get
if anyone has any more ideas please do ping
this was an awesome challenge, just a coincidence i happened to know about dc
dc is pretty damn cool
pure dew
dont bother with saving o
vague gust
oh yeah good idea
pure dew
just next(...).modules['os'].execve("dc", ("dc", "-e", input()+" p"),{})
vague gust
yeah
next(c for c in object.__subclasses__()if'ModuleLock'in str(c)).acquire.__globals__['sys'].modules['os'].execve("/bin/dc",("dc","-e",input()+"p"),{})
this bad boy is a one liner now
pure dew
u may be able to remove /bin/ if it's in your path
and it'd become cross platform
@brisk zenith coconut is cool
Y = f -> (*args) -> f(Y(f))(*args)
fac = Y(f -> n -> 1 if n < 2 else n * f(n - 1))
fac(5) |> print
oh hell is that a y combinator
i'm trying to understand those in regular python haha
pure dew
its a bad one
tropic gulch
a what?
pure dew
it shouldnt be recursive, but im still wrapping my head around the non-recursive version
brisk zenith
"In functional programming, the Y combinator can be used to formally define recursive functions in a programming language that does not support recursion."
pure dew
its a (non-recursive) function that turns a non-recursive function into a recursive function @tropic gulch
tropic gulch
🤔
pure dew
oh rite
brisk zenith
arctic bridge
dc is not a default package, and it's not on Windows
But it does accomplish the objective...
vague gust
ah it is owned by bc
λ yay -Qs bc
local/bc 1.07.1-1
An arbitrary precision calculator language
shame
frosty wyvern
Joseph may I add your solution to our archives (: credit to name Joseph?
vague gust
Sure thing my guy
do mention it is not compatible on all systems or without the bc package though
frosty wyvern
yep
brisk zenith
@wind maple for your fractal challenge, will we allow imports?
wind maple
anythings allowed
brisk zenith
oh okay
brisk zenith
here we go ```py
fractal = lambda factor: (lambda invert, expand: (import("functools").reduce(lambda value, _: (expand(value, value) + "\n" + expand(value, invert(value))), range(factor - 1), "#")))(invert=lambda string: (lambda temp_char: (string.replace(".", temp_char).replace("#", ".").replace(temp_char, "#")))(temp_char=chr(ord(max(string)) + 1)), expand=lambda first, second: ("\n".join(one + two for one, two in zip(first.split(), second.split()))))
hm @wind maple can you confirm this works?
brisk zenith
oh okay, sure.
>>> print(fractal(4))
########
#.#.#.#.
##..##..
#..##..#
####....
#.#..#.#
##....##
#..#.##.
looks fine to me though.
>>> print(fractal(6))
################################
#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#.
##..##..##..##..##..##..##..##..
#..##..##..##..##..##..##..##..#
####....####....####....####....
#.#..#.##.#..#.##.#..#.##.#..#.#
##....####....####....####....##
#..#.##.#..#.##.#..#.##.#..#.##.
########........########........
#.#.#.#..#.#.#.##.#.#.#..#.#.#.#
##..##....##..####..##....##..##
#..##..#.##..##.#..##..#.##..##.
####........########........####
#.#..#.#.#.##.#.#.#..#.#.#.##.#.
##....##..####..##....##..####..
#..#.##..##.#..##..#.##..##.#..#
################................
#.#.#.#.#.#.#.#..#.#.#.#.#.#.#.#
##..##..##..##....##..##..##..##
#..##..##..##..#.##..##..##..##.
####....####........####....####
#.#..#.##.#..#.#.#.##.#..#.##.#.
##....####....##..####....####..
#..#.##.#..#.##..##.#..#.##.#..#
########................########
#.#.#.#..#.#.#.#.#.#.#.##.#.#.#.
##..##....##..##..##..####..##..
#..##..#.##..##..##..##.#..##..#
####........####....########....
#.#..#.#.#.##.#..#.##.#.#.#..#.#
##....##..####....####..##....##
#..#.##..##.#..#.##.#..##..#.##.
expanded and annotated.
fractal = lambda factor: (
# Below is the "main" part of the function.
lambda invert, expand: (
__import__("functools").reduce(
lambda value, _: (
expand(value, value) + "\n" +
expand(value, invert(value))
), range(factor - 1), "#"
)
)
)(
# A function to invert a string. All '#' are swapped with '.'
invert = lambda string: (
lambda temp_char: (
# Replace all occurrences of "." with a temp char.
string.replace(".", temp_char)
.replace("#", ".")
.replace(temp_char, "#")
)
)(
temp_char = chr(ord(max(string)) + 1)
),
# A function to expand each line of a string
# with the lines of another string.
expand = lambda first, second: (
"\n".join(one + two for one, two in zip(
first.split(), second.split()
))
)
)
do you usually code ina functional style though like in every day use
brisk zenith
nah, that's impractical with python's lambda limitations.
frosty wyvern
yeah
I enjoy functional-ish programming in JS, syntax is a bit better for it
I was learning Haskell for a bit but
brisk zenith
i've never used a proper functional programming language though
frosty wyvern
after learning the 30th operator symbol i got a bit overwhelmed
brisk zenith
lmao
frosty wyvern
I feel like I might enjoy something like Erlang though if I were to try it
or any other functional language
Haskell doesn't see much use in practical every day life
I mean it sees some but
anywho, it was regardless a good learning experience
sorry back on topic
trying to golf a brainfuck interpreter rn
hmmm
grrr Python's function definition syntax is kind of a pain in the rectum
brisk zenith
a functional implementation of python
frosty wyvern
oooo
how does it work? Does it get like transpiled to regular python from its own language or what
brisk zenith
ooh i should make a functional brainfuck interpreter
frosty wyvern
please do
make it a nice oneliner so we can easily embed it in an !eval command : )
brisk zenith
all my functional codes thus far have been one-liners
and i plan to keep it that way :D
pure dew
@frosty wyvern it gets transpiled to python
you can actually see the output on the website, they've got an interactive interpreter
brisk zenith
oh not yet, been a little busy :D
brisk zenith
no it really isn't
fallen heath
I see multiple solutions up there using list comprehensions, is that allowed under the no lists rule?
tropic gulch
interpreting bf is way easier than writing it
brisk zenith
@fallen heath list comprehensions are like [x + 1 for x in whatever]
fallen heath
yes
brisk zenith
but you can do generators with (x + 1 for x in whatever)
and set comprehensions with {x + 1 for x in whatever}
and dict comprehensions with {key: value for key, value in zip(iter_one, iter_two)} for example
cunning wave
wait
brisk zenith
"list comprehension" simply needs [...]
cunning wave
that 2nd one is valid?
brisk zenith
yes
cunning wave
😮
brisk zenith
why wouldn't it be?
pure dew
second is a set
cunning wave
i see
brisk zenith
so you'll find that none of the examples above used list comprehensions @fallen heath :)
sick hound
cpython interns small strings or something
brisk zenith
oh are <= 20 length strings cached like -5 < ints < 256
fallen heath
interesting
cunning wave
cpython expands 20 * 's' inside its pyc files
above not
so the first one actually gets expnaded during compilation
fallen heath
I had no idea you could make a generator like that
cunning wave
while the 2nd one is evaluated during runtime
brisk zenith
yeah, my code has quite a few of them Grote.
it doesn't even need parentheses if it's the only argument in a function or w/e
so py "\n".join(thing for thing in ("hello", "world")) puts a generator as the first argument to str.join and the method consumes it.
cunning wave
also note
>>> x = ['aaaaaaaaaaaaaaaaaaaaa']
>>> 'a'*21 in x
True
>>> 'a'*21 is'aaaaaaaaaaaaaaaaaaaaa'
False
>>>
I can build a python compiler in python!
code = input("Python Code: ")
print(eval(code))
/s
pure dew
i can break it
brisk zenith
@sick hound that would be a python interpreter at best, i don't see a compiler :P
sick hound
(gp, but then you don't really compile python)
brisk zenith
you can.
frosty wyvern
Yes it gets compiled from source to bytecode
frosty wyvern
yeah at least use exec sheeeesh
brisk zenith
lmao
and as shawn said, cpython (the reference implementation of python) gets compiled to bytecode, which is then interpreted. (i believe)
pure dew
reference implementation is not always best implementation
brisk zenith
who said it was? :P
cunning wave
lemon the python priest
cunning wave
@vague gust can we have
lemon the python priest
as ot name
arctic bridge
It's the best implementation because it by far has the most support and development time put into it
brisk zenith
and every other implementation stems from the reference implementation as the name suggests, so /shrug
fallen heath
lambda t:(t[a:b]for a,b in map(lambda a,b,v=lambda x:(y for y,z in enumerate(x)if z==' '):(a,b),(0,*v(t)),(*v(t),len(t))))```
the string,split(t, ' ') i finally got working 😃oh nice :D
my split was pretty chunky: ```py
split = lambda string: ((lambda spaces: (string[start:end - 1] for start, end in zip((0, *spaces), (*spaces, len(string) + 1))))(spaces = tuple(index + 1 for index, char in enumerate(string) if char.isspace())))))
I saw you using zip, didn't know about that :P
lambda t,v=lambda x:(y for y,z in enumerate(x) if z==' '): (t[a:b]for a,b in zip((0,*v(t)),(*v(t),len(t))))```
new versionAlso the previous one only worked because of an assignment earlier in the file so that one didn't actually work :/
brisk zenith
oh lol
fallen heath
#challenge1
lambda t, a={},v=lambda x:(y for y,z in enumerate(x) if z==' '):{*map(lambda b: b.strip().isdigit() and (a.update({len(a):b})or True)or b==" " or a.update({len(a)-2:str(eval(f"{a.pop(len(a)-1)} {b} {a.pop(len(a)-1)}"))}),(t[a:b]for a,b in zip((0,*v(t)),(*v(t),len(t)))))} and a[0]```sure
sick hound
what is this cooode???
pure dew
@sick hound read channel desc pls
brazen geyser
i would say that's beautiful but i'd be lying
frosty wyvern
I probably should have tested the submissions 😃
brazen geyser
challenge #666: rewrite cpython in python using ctypes
frosty wyvern
@fallen heath Yours works but only for one operation it seems 😛
@brisk zenith yours seems to work perfectly though
@sick hound yours I can't get to run but you generate bytecode so that's cool
It's not a real contest anyways, it's more a coding exhibit than a coding contest
Grote I'll still add yours to the archive, if you want to make another submission we can add it as well 😃
brisk zenith
yeah i get invalid syntax on pastebean's
frosty wyvern
I didn't try running it as a script though
sometimes repl throws syntax errors for things that work in a script file
though if we discount joseph's I think yours is the only one of the other solutions that actually works for deeper stacks
like 1 2 3 + +
brisk zenith
well it's pretty simple when you implement a full stack class haha
frosty wyvern
lol true
Honestly though seeing all these weird solutions make me realize that I don't care much for having actual contests, at least personally
fallen heath
Yeah, it only takes in strings that are formatted with the operators instead of those fancy icons
frosty wyvern
Of course if people who participate really want to be competitive then whatever I guess but
I much more enjoy a more relaxed environment where people just come up with all kinds of different crazy solutions
long or short, robust or not
brisk zenith
i'm not bothered about being competitive
i'm just having fun making stuff like this.
frosty wyvern
😄
brisk zenith
which is ultimately the goal here, is it not? :D
frosty wyvern
Yes ❤
sick hound
@brisk zenith You get invalid syntax with mine???
brisk zenith
i do.
sick hound
in the interpreter or a .py file?
pure dew
moist-machine
sick hound
...how
brisk zenith
might be the way i pasted it
lemme try again
oh never mind
can confirm it works.
fallen heath
#challenge-1
c = lambda t,q=str.replace:(lambda t,a={},d=dict.update,v=lambda x:(y for y,z in enumerate(x)if z==' '):{*map(lambda b: b.strip().isdigit()and(d(a,{len(a):b})or True)or b==" "or d(a,{len(a)-2:str(eval(f"{a.pop(len(a)-1)}{b} {a.pop(len(a)-1)}"))}),(t[a:b]for a,b in zip((0,*v(t)),(*v(t),len(t)))))}and a[0])(q(q(q(t,'×','*'),'−','-'),'÷','/'))```Now with support for those fancy characters
frosty wyvern
wow that makes me want to vomit, it's beautiful, I'll update the entry on the repo soon
frosty wyvern
Unofficial side-challenge:
Do something wtf using ctypes and stuff like memset
wind maple
>>> ctypes.cast(id(4), ctypes.POINTER(ctypes.c_int))[6] = 5
>>> 2 + 2
5```OH MY GOD
I WAS TRYING TO DO SOMETHING LIKE THAT LAST NIGHT
I kept crashing my interpreter though
heck
Thanks Ava
😃
Wouldn't that be hilarious to slip into a Python package
changing values of a bunch of those cached constants
sick hound
hey (:
frosty wyvern
Greetings
sick hound
just thought I'd take that question asked in help-0 about inverting an array of 0's and 1's and try to solve it with a one-liner, comments welcome:
vestal solstice
flip = lambda a: reduce(lambda x,y: x+[1-y],[[1]]+a)[1:]
ah I see
flip = lambda a: reduce(lambda x,y: x+[1-y],a,[])
frownyfrog, nice
brisk zenith
huh, what does that do?
sick hound
@brisk zenith flip 0's and 1's in an iterable
brisk zenith
oh huh
vague gust
where did reduce get moved to in python3?
vague gust
ah
sick hound
and oops, misread that 😃
brisk zenith
yeah
i used functools.reduce in my fractal code for ava
@frosty wyvern even though it's not official, i think ava's challenge should be pinned tbh
pure dew
apparently i dont have itertools on my system
fallen heath
brisk zenith
🤔
pure dew
I think i broke something
>>> 5 != 3
File "<stdin>", line 1
5 != 3
^
SyntaxError: invalid syntax
>>> 5 <> 3
True
from __future__ import barry_as_FLUFL
atomic violet
oh you guys finally gave a better name to this channel huh 😂
fast torrent
@novel vine didn't work
novel vine
Oh idk then. I don’t really golf
fallen heath
@fast torrent
>>> 0 or 42
42
>>> 0 and 42
0```you can use that logic to return a different value
fallen heath
natsu has 118
novel vine
I did it in 2,800
fast torrent
@fallen heath without changing the func name?
fast torrent
Nice
fallen heath
my own solution is 133
novel vine
I went for the one line everything approach
fallen heath
neat
fallen heath
Submitting the proper one is for the best
frosty wyvern
Whats we golfing
fallen heath
The code jam verification thing
brisk zenith
oh oh i should submit a functional entry.
i could declare the class functionally, at least.
that would be interesting.
brisk zenith
is there a better way to initialise a dummy generator than (_ for _ in ())?
novel vine
Probably not style wise
buoyant agate
So he can throw an exception on one line(_ for _ in ()).throw(...)
tropic gulch
sick hound
(_ for _ in()) 🤷
brisk zenith
it's not just for one line, it's so that it can be used in an expression
for example, raise can't be used in lambda expressions
fuck too much terminology.
sick hound
sweet yup
brisk zenith
i should make a little module for assistance with functional programming in python 👀
such as a throw function, as an alternative to the raise statement
buoyant agate
How in the world
brisk zenith
because you can do for (first, second) in zip(...) for example
so the middle () is a tuple
of nothing 🤔
brisk zenith
if you just want an exception, do 0/0
brisk zenith
:D
wind maple
ned batchelder uses it for debugging lol
buoyant agate
Just cause a name error
brisk zenith
oh nice
though my goal here isn't really throwing exceptions in a golfed way, it's more about how throw exceptions in a lambda statement as a whole. as amazed i am at (0for()in()), it's not really any more elegant than (_ for _ in ())
and it seems like creating a generator atm is the only relatively elegant way to raise exceptions
in a single expression, rather than a statement
sick hound
oh boy
on the topic of the above: if you ever happen to need n copies of some object x in a list, [x for () in repeat('', n)] works
any empty iterable can be used instead of ''
So I wonder if [[] for () in repeat('', 10)] is at all faster than [[] for _ in range(10)]
sick hound
say it's something you need copies of 🤷
like the usual "idiom" [[] for _ in range(n)]
tropic gulch
>>> [1 for () in repeat('', n)]
File "<stdin>", line 1
SyntaxError: can't assign to ()
works on 3.6 for me ye
sick hound
itertools.repeat my b
wind maple
I wonder if that's intentional or not
brisk zenith
>>> die = lambda: do_raise(ImportError("This is an error right here."))
>>> die()
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "<stdin>", line 1, in <lambda>
File "lambdatools.py", line 5, in <lambda>
).throw(exception)
File "lambdatools.py", line 4, in <genexpr>
_ for _ in () # Damn, that's a chunky error you've got there.
ImportError: This is an error right here.
>>>
i will mock people in my tracebacks
wind maple
unpacking empty tuple seems really weird
tropic gulch
@sick hound range is twice as fast
>>> timeit.timeit("[1 for () in repeat('', 100)]", globals=globals())
5.638906572999986
>>> timeit.timeit("[1 for _ in range(100)]", globals=globals())
2.948414624999714
Where is this repeat coming from?
brisk zenith
itertools
buoyant agate
Ah
brisk zenith
do you guys think i should create a module for bunch of utilities for functional scripts, with the twist that the module itself is also functional? lmao
wind maple
range is written in c
pure dew
funny how that works eh?
brisk zenith
ikr
there really isn't a way to catch exceptions in a lambda expression, is there?
@sick hound hey pastebean do you have any not-very-hacky ideas? preferably without imports.
sick hound
@brisk zenith Not without a function that does it for you
brisk zenith
yeah that's what i was thinking
sick hound
def try_func(f):
try:
return f(), True
except Exception as e:
return e, False``` you'd need to have something like this@frosty wyvern hi mr shawn please merge https://github.com/shawnmcla/python-discord-challenges-archive/pull/1
fervent vine
brisk zenith
your isint function can be changed to simply use mem.isdigit() on your stack updating @fervent vine
little patrol
@vague gust Shouldn't your commit have replaced execve with execvp?
Cause with the latest commit it doesn't run unless you change it to execvp
brisk zenith
that's what i was thinking, but i didn't test it.
vague gust
@little patrol that was an intentional bug and i was just testing you
little patrol
Did I just ruin it for the whole channel 
fallen heath
Does that really count as not doing an import?
it even relies on an external program to be installed 🤔
fallen heath
little patrol
Geez you guys are so much more talented than I am haha
fallen heath
talented is a nice way of putting it
frosty wyvern
@vague gust I'm gonna decline your mr and tell you that you should be retroactively aborted
vague gust
shAWN WHY
frosty wyvern
jk 😃
fast torrent
#abortjoseph
stray needleBOT
Joseph Banks pushed to branch master of python-discord/esoteric-python-challenges (Compare changes)
frosty wyvern
We've now move the challenges to GitLab, thanks to Joseph. To make submissions simply either create a merge request with your solution in a file called yourname.py under the challenge directory or as before share your code here and I'll add it for you if you don't want to bother. Feel free to submit more than one solution, just append them to your solution file 😃
little patrol
Where's my credit, joseph was wrong in his original mr
🤔
vague gust
yeah but i'm awesome
little patrol
b-but that's owner privilege
brisk zenith
joseph is infallible
little patrol
this is a fact
dense spire
owner privileges are a serious problem affecting this community!
some of my best friends are owners and they're both pieces of shit so I know what I'm talking about
brisk zenith
hey at least i'm not an owner right :^):^)
little patrol
at least you guys aren't he who shall not be named level of owners/mods/helpers
little patrol
also wrong channel for this but since you all were here, shoutouts to the peeps who run this discord and the subreddit, you guys and gals are the greatest
vague gust
❤
stray needleBOT
Shawn McLaughlin pushed to branch master of python-discord/esoteric-python-challenges (Compare changes)
frosty wyvern
Added some info on how to submit solutions and what not
Thanks btw to all who submitted some solutions so far for this week's problem 😃
If you have challenge suggestions, don't hesitate to let me know! Shoot me a DM or whatever. I'll try to have a new challenge at least every week, sometimes a bit earlier. Always feel free to submit solutions for older challenges, too! I lie to stress that this is not a serious competition. The goal is to have fun and code 
frozen rune
Shawn McLaughlin
We related it one way or another
my last name is McLaughlin, capital L and all
teal rune
are we allowed to use eval in the reverse polish challenge?
polar wolf
fallen heath
i used eval in mine @teal rune
fallen heath
keep in mind the challange uses a different * / and - from the normal python ones
fallen heath
i used eval with a str.replace
teal rune
yeah I just checked your contrib on the github mentioned in the pinned post
fallen heath
(q(q(q(t,'×','*'),'−','-'),'÷','/'))
here q = str.replace
and t is the string
you can alias functions like that
teal rune
ok fixed that, don't think it's very compact now though
apparently does have less characters than your submission however
teal rune
I'm not an expert on git but I have no clue how to properly send a merge request with all these permissions and stuff
so I'm supposed to send a merge request to the gitlab repo, I created a fork commited my addition and now how do I send the request?
dense spire
basically once your branch is ready on your fork, you just go to the fork on gitlab and follow the wizard in the merge requests tab
it should be fairly straight forward
make sure you target our repo
frosty wyvern
And though I strongly strongly encourage you learn how to use Git and GitLab (fantastic tools to learn and use!), if you can't figure it out we can post the code up for you :)
teal rune
it gives me a 404 page
I know how to use git, not familiar with gitlab however
actually 403
I'm following the guide, I was before
I just keep getting this permissions page
I don't know what I'm doing wrong:
I have my fork, it's ready and everything
afterwards I click on the merge requests and click new merge request
I make sure the targets and stuff are correct
now I don't change anything on the next page, it's all good
but if I then click submit I get this error page
am I like the first to test this on the gitlab here? what am I doing wrong?
vague gust
That's odd hmm
Ah crap, that's my fault @teal rune sorry
I left a configuration option set to private
teal rune
oh
vague gust
I've now changed it so hopefully you should be able to access that MR page now
teal rune
I thought I was going crazy
vague gust
my apologies haha
teal rune
still gives me the same error
vague gust
hmm, can you try once more?
teal rune
yup all's cool now, I'll just wait for it to be approved I guess
frosty wyvern
I believe we are approaching time for a new challenge
Hit me up with any ideas, I'm gonna try to come up with something tonight
fast torrent
A one liner that does fizz buzz.... But is a pallandrom?
dense spire
generate a random simple sentence, like "I have floppy pants.", no literals allowed.
vague gust
frosty wyvern
What in the world are floppy pants
stray needleBOT
Joseph Banks pushed to branch master of python-discord/esoteric-python-challenges (Compare changes)
brisk zenith
i have floppy's pants
frosty wyvern
LOL
brisk zenith
dressed in floppy attire
frosty wyvern
I remember once purchasing a High Density floppy disk at Staples for like 5$ and being disappointed that it didn't mean it had more space on it
fast torrent
Damn
frosty wyvern
I was one dumb 11 year old
brisk zenith
oh i see
frosty wyvern
but how do it know it a good word
dense spire
that's part of the challenge
dense spire
iunno, workshop it
fallen heath
random.choice(string.alphanumeric)
dense spire
yes, there are.
frosty wyvern
can you use literals that are in the internals.
dense spire
I'm guess you'll have to build your own little dictionary out of class names and stuff for internals, possibly partials, and then make it spit out short sentences based on those words?
frosty wyvern
Well it doesn't have to be code golf challenges either
dense spire
yeah, any esoterica is fine
frosty wyvern
as long as it promotes being creative/clever/hacky
dense spire
haha, palindrom checker that is a palindrom is probably impossible.
frosty wyvern
oh man
fast torrent
Not litrally
frosty wyvern
that'd be a tough one
fast torrent
But like lamada on one side
brisk zenith
very unless you comment the last half
fast torrent
Lamada on the other
X on one side
X on the other
Closest to a pallandrom wins
That would be really difficult and really interesting
brisk zenith
hard to judge more like
dense spire
too hard, I think
frosty wyvern
Oh you know what could be also an interesting challenge concept, to have to do something based on some provided pre-written code, instead of always being doing things from scratch
dense spire
mmmm
fast torrent
Yeah
frosty wyvern
kinda like the qualifier but yknow, not easy
dense spire
take this code and fuck it up
frosty wyvern
LOL
dense spire
that's actually fun
I did that for the second qualifier
a bit of esoterica I wrote that returns a couple of literals I used to print the lyrics to bob marleys "jammin"
frosty wyvern
LOL.
fast torrent
Jesus Christ
frosty wyvern
!eval
exec(''.join([chr(int(c)) for c in '48$61$93$54$91$41$41$116$110$105$95$99$40$82$69$84$78$73$79$80$44$41$52$40$100$105$40$116$115$97$99$59$42$32$116$114$111$112$109$105$32$115$101$112$121$116$99$32$109$111$114$102'.split('$')][::-1]))
print(f"2 + 2 = {2+2}")
I get giddy every time for some reason
frosty wyvern
dense spire
he wrote a True bitshift generator
frosty wyvern
ooo
dense spire
it's super cool
takes any string and creates that bitshift sequence bullshit in order to reproduce it.
fast torrent
Of course he did
frosty wyvern
that's a fantastic tool.
fast torrent
:^)
dense spire
code that generates ugly code is the best
dense spire
oh oh
that's a good challenge idea
write a text uglifier
take a string, return super ugly code to generate that string
the more unreadable the better
frosty wyvern
okay I think I'll base the next challenge on Lemon's random text generator idea
dense spire
sounds fun
vague gust
hehe i have a great idea
fast torrent
Turn it into a image
That is a screenshot of ugly code
But turns back to the string
frosty wyvern
errrrrr
Do you guys know if random.seed is consistent between platforms/systems or if it's purely system specific?
e.g. if I run some code with the same seed on different computers will it produce the same results?
frosty wyvern
Joseph shut up and answer my question 😠
brisk zenith
nice lmao
frosty wyvern
jk
vague gust
here is a sneak peek https://i.seph.club/k71g7.png
frosty wyvern
:))))
brisk zenith
#!/usr/bin/env python
string = input(">> ")
code = ""
for c in string:
byte = ord(c)
count = 0
while byte != 0:
if byte % 2 == 1:
code += "True << {} ^ ".format(count)
byte >>= 1
count += 1
code = code[:-3] + ", "
code = "''.join([str(chr(c)) for c in [{}]])".format(code[:-1])
print(code)
input a string, output that True bitshift madness. first code i made after joining this server.
give it a go
vague gust
frosty wyvern
omg no one will answer my friggin question eh
frosty wyvern
windoze
brisk zenith
ill test on android then ill go to sleeps
tropic gulch
I'd assume seed is platform independent
fallen heath
Same seed should give the same randomness
frosty wyvern
import random
random.seed("poo")
for x in range(10):
print(str(random.randint(0,100)))
please give me outpoots
tropic gulch
because it seeds Python's internal rng algo
fallen heath
But for non seeded randomness that's platform dependend
frosty wyvern
Yeah I'd assume so too but I wanna be sure cause it might have some implications for my challenge
vague gust
>>> import random
>>> random.seed("poo")
>>> for x in range(10):
... print(str(random.randint(0,100)))
...
89
5
32
76
4
60
34
67
68
24
Randomness with a fixed seed should include no actual randomness
tropic gulch
same
frosty wyvern
whew
thanks guise
<3 yall the bestest
k yall wanna review the draft of challenge 02 before it goes up
Challenge 02 - Random Text Generator
Task: Create a function that takes in a number, and returns a randomly generated string of semi-valid English.
Goal: Program that creates the most consistently coherent phrases "wins", honourable mentions for absurdly hilarious outputs
Restrictions:
[*] NO STRING/CHARACTER LITERALS NOR USER DEFINED STRINGS
[**] That includes fancy shmancy workarounds like storing a bunch of numbers and converting them to letters
[*] NO FILE/USER INPUT EXCEPT LOADING STANDARD LIBRARY MODULES
[*] NO NON-STANDARD LIBRARY MODULES
[*] NO NETWORKING - AT ALL
> Yep. You read that right. You'll have to look deep *inside* for some words to jumble together.
Submission guidelines:
As always, submit your code as specified in the repository's root README file.
Ideally, submit your code with comments including some example outputs and the random seed/state needed to recreate it.
Remember that this is not a true contest, so don't hesitate to try crazy stuff. Get creative.
Tips:
* Since you can't get lists of words from the user or from outside sources, you'll have to look somewhere else.
* The Python [random](https://docs.python.org/3.7/library/random.html) module has functions that allow you to set seeds and to get/restore states. This can be useful
to generate the same output again should you come across some good results on a particular run.
Special thanks to Lemon for the idea <3
:^)
looks good to me
https://gitlab.com/python-discord/esoteric-python-challenges/merge_requests/1 this probably also needs to be commented on @frosty wyvern
fallen heath
So no import randomwords :(
frosty wyvern
Well, first it doesn't truly respect the restriction of no lists, but it's still otherwise a pretty impressive solutions
I'll pull it in and just add a comment in the header that states that it doesn't fulfill all criteria
but as I hope I've made pretty clear up to now, I don't care that much about restrictions and rules
vague gust
👌
frosty wyvern
they're meant to foster some creative thinking
So I'd rather people submit clever solution that break the rules than not submit at all ^_^
stray needleBOT
Shawn McLaughlin pushed to branch master of python-discord/esoteric-python-challenges (Compare changes)
Shawn McLaughlin (shawnmcla) merged !1 *My commision for the first challenge* in python-discord/esoteric-python-challenges: My commision for the first challenge
vague gust
looks good to me
i wish gitlab didn't do those funky embeds
but it was just saying you commited the changes to master and merged a MR
frosty wyvern
yeah I know but I get two Sign in embeds
dense spire
yep
vague gust
yeah, odd gitlab thing
dense spire
that's just gitlab sucking a bit at webhooks :(
frosty wyvern
:(