31
HeNeArKr
11 35 44 Leader of the month
5289/ 5695
Last seen 2 years ago
Member for 8 years, 1 month, 5 days
Difficulty Normal
Best reviews / Newest reviews
Take these broken rings-HeNeArKr
Reviewing my own code. Line 9 would probably be better as: all_rings = set.union(*rings) More
Stargate-HeNeArKr
Oops, that last line should just be 'return a_unit == unit_1' More
[a1, a2][fight(a1[0], a2[0])].pop(0)-flpo
Oooh, that Battle.fight is clever. More
Buy high, sell low?-HeNeArKr
Self review: I should have used return max(data, key=data.get) instead. More
A fiery grams van-HeNeArKr
Self review: while reviewing other (better) solutions, I realized that the two lists should simply have been directly compared. **return lett1 == lett2** More
Dijkstra with priority queue-Phil15 1
I really like the way that this takes advantage of unique capabilities of Python (like defaultdict and dict.get) to implement Dijkstra's algorithm in a clean and concise way. More
Straight line-HeNeArKr
Self-review: line 22 would be better as if W - d < 2 * xp < W + d: More
numpy--dead-inside-
Ha! I had the same idea, but you did it better! More