39
CDG.Axel
18 36 55 Leader of the month
9398/ 9695
Axel
Last seen 2 months ago
Member for 2 years, 9 months, 17 days
Difficulty Normal
Best reviews / Newest reviews
4 lines proc-CDG.Axel
Based on my [long solution](https://py.checkio.org/mission/node-subnetworks/publications/CDG.Axel/python-3/6-lines-proc/) for New Cities More
except me in the lie-gyahun_dash
The only way raise needed on this site :) More
First-Andrej_Jadlovskij
Great way to count zeros Btw... len(number.lstrip('0')) vs len(str(int(number))) More
First-lisdrog
longer than simple val[::-1], and not faster More
reduce-spitfire_ch
imo shortest solution ) PS: if you avoid numpy.prod More
as & median simple-dotvet33
it's a cheat :) but it's shortest solution More
One liner-petr.synek.phd
better way to sort data before, than create 3 more lists and "len(data)//2" better than "int(len(data)/2)" More
on-off-katnic
you can use this for shorter solution on = List[::2] off = List[1::2] (O-I).total_seconds() More
First-tokiojapan55
There is one small trick that helps you greatly shorten the code: - collect all free point to a set of (x, y) tuples - than operate one condition for all bound and color tests - (new_x, new_y) in free_points More
for - if - else-jiieko
1. continue is not necessary 2. you can replace "break" with "return True" and "return count >= 3" with "return False" More
bad guy-viktor.chyrkin 1
Very good! Btw small optimization: b = {} for j in filter(None, a.split('\n')): More
Common Words-tssrkt777
Ideas for one-liner: - sets - & operation with sets - sorted - ','.join() More
n=10^9 in 2 minutes-StefanPochmann
Ultra fast! Btw published version is the fastest... More
8-liner: cleanest recursive-przemyslaw.daniel
it's better replace dice_number == 1 --> dice_number == 0 return sum(probability(dice_number-1, sides, target+~i) for i in range(sides)) / sides if dice_number else not target https://py.checkio.org/mission/probably-dice/publications/CDG.Axel/python-3/one-line-recursive-with-lr More
Less line but weird-CDG.Axel
This solution is slightly longer (+3 lines), but clearer https://py.checkio.org/mission/landing-site/publications/CDG.Axel/python-3/all-distances/ More
9 lines (2nd try)-CDG.Axel
The main goal was minimum lines, with no single line longer 120 symbols More
4 lines-DiZ
Great idea with filter(set.intersection,...)! I used [e for e in network if e & friends] for this :( Btw it helps to avoid PEP8 violation: [graph.update(*filter(graph.intersection, edges)) for _ in edges] More
101-liner: 10**12 in 2min-przemyslaw.daniel 1
Fastest solution for this time :) But I can't understand all the math there... More
Story Time-StefanPochmann
In this task interpretation heroes could be ennis_del_mar and jack_twist :) More
First-amvasiliev80
Ideas for removing flags from code: 1. Take a letter form source string 2. Throw away two letters after if it is a vowel 3. Throw away one letter after else More
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
28
29 30 31