lesenv profile - python coding challenges

57

math-veky 2 1

wow, why do you write always one-liners? is it just for fun or the challenge or is there another reason? funny, that this is possible... completely unreadable by normals like me. More

33

PositronicLlama

One line-PositronicLlama 1

this is so easy to read and so hard to think of... More

57

veky

Shoelace-veky 1 1

for x,y in d: a,u,v=a+x*v-y*u,x,y clever, clever! i had to look twice to get it. nice :) More

49

Sim0000

First-Sim0000 1 1

so much simpler :) i used the re-module *blush* More

16

Miaou

Dijkstra's Forever !-Miaou 1

i thought this algorithm was quite nice. after having read guidos post i'm feeling kind of stupid aside him. thumbs up nevertheless More

16

mr.floppy

First-mr.floppy 1

finally i came up with something similar to the best solutions... HURRA More

45

bryukh

Convert and Iterate-bryukh

i wanted to avoid the init of res = 1, so i found the functools.reduce. but now i see that your code i so much readable. thumps up! More

31

Cjkjvfnby

reduce-Cjkjvfnby

great! i just changed my solution. i had the same idea that you had, but mine was not as clear. thanks! More

15

nptwz

First-nptwz

i didn't see that one coming. good thinking! More

12

dknn

To recurse is divine-dknn

phew, i had to think about this solution... wow. does _n//10_ automatically decrease _n_? More

16

Moonra

Second-Moonra 1

at first i didn't even see the differences to the first attempt. I had to look at the first again and there in the comments i saw what you changed. subtle but nice to know where to make those changes. edit: do you and veky know each other? More

31

Amachua

First-Amachua

i don't get it. where are the possible paths compared to each other? to my untrained eye it seems like the last valid path is chosen. minSize = 1000 bestPath = 0 for i in range(len(possiblePath)): if len(possiblePath[i]) < minSize and len(possiblePath[i]) More