Dec. 20, 2019, 11:50 a.m. |
+ 1 |
for Comment
nickie: A fixed version of my [first solution](http://www.checkio.org/mission/painting-wall/publications/nic...
|
Dec. 19, 2019, 12:06 p.m. |
+ 1 |
for Comment
kurosawa4434: Hi colinmcnicholl. >one of those previous regions is fully overlapped by one of the other previous r...
|
Dec. 14, 2019, 11:08 a.m. |
+ 3 |
for
Rotating Convex Hulls-JamesArruda
|
Dec. 14, 2019, 11:04 a.m. |
+ 3 |
for
[8lines+old code] Rectangles based on edges from convex hull, change complex coordinates to have bounding boxes-Phil15
|
Dec. 13, 2019, 10 a.m. |
+ 1 |
for Comment
Phil15: Great job with numpy! Even if I prefer my way with complex numbers. `cmath` module could do a part o...
|
Dec. 12, 2019, 10:58 a.m. |
+ 1 |
for Comment
Phil15: I don't see the vote +3. :-D > I like how your convex hull() function works from far left over high ...
|
Nov. 30, 2019, 10:06 a.m. |
+ 1 |
for Comment
annbelolikova: nice :) further, the same can be done without using len(set(...) if sum up directly: sum(1 for word ...
|
Nov. 27, 2019, 9:37 a.m. |
+ 1 |
for Comment
oduvan: should be fixed now
|
Nov. 14, 2019, 11:50 a.m. |
+ 4 |
for
26-liner: AL19-przemyslaw.daniel
|
Nov. 7, 2019, 12:15 p.m. |
+ 2 |
for
DFS-Trailblazer
|
Nov. 4, 2019, 8:58 a.m. |
+ 1 |
for Comment
Ylliw: Nice and clear. I used the same method and convert it into a 1-liner. Less readable on one single li...
|
Nov. 2, 2019, 11:31 a.m. |
+ 4 |
for
recursion & memoization-kurosawa4434
|
Oct. 30, 2019, 1:55 p.m. |
+ 1 |
for Comment
kurosawa4434: You have to find N in each test yourself. In the first example, N is 2. because there is no landing ...
|
Oct. 29, 2019, 10:35 a.m. |
+ 1 |
for Comment
kurosawa4434: In other words: * No obstacle hexes within **N** hexes. * **N** is maximum.
|
Oct. 26, 2019, 9:45 a.m. |
+ 1 |
for Comment
Phil15: I didn't know difficulty depend on the island too, at first. Dynamic programming is about this thing...
|
Oct. 25, 2019, 8:15 a.m. |
+ 1 |
for Comment
Phil15: First, it's "elementary" for the hubspot island, which is a difficult island, so not really elementa...
|
Oct. 16, 2019, 1:23 p.m. |
+ 1 |
for Comment
gubin.m.u: Short and to the point.
|
Oct. 16, 2019, 1:21 p.m. |
+ 1 |
for Comment
Trailblazer: Nice solution with %.
|
Oct. 12, 2019, 10:39 a.m. |
+ 1 |
for Comment
Ilis: Itertools is very suitable here. Clear solution.
|
Oct. 10, 2019, 9:24 a.m. |
+ 1 |
for Comment
kurosawa4434: Thanks @colinmcnicholl :-) As you think, You can get the list of random tests by running the functio...
|
Sept. 23, 2019, 9:45 a.m. |
+ 3 |
for
First-Pavel_Abarkin
|
Sept. 16, 2019, 8:25 a.m. |
+ 3 |
for
zip-Sim0000
|
Sept. 4, 2019, 1:40 p.m. |
+ 1 |
for Comment
huynhphillip57: Nice use of datetime and parameter expansion.
|
Sept. 3, 2019, 8:20 a.m. |
+ 4 |
for
7-liner: flat-przemyslaw.daniel
|
Aug. 31, 2019, 8:35 a.m. |
+ 1 |
for Comment
mikael.desharnais: Very nice and thorough comments !
|
Aug. 22, 2019, 10:06 a.m. |
+ 1 |
for
itertools.groupby(iterable)-David_Jones
|
Aug. 15, 2019, 12:55 p.m. |
+ 3 |
for
Straightforward-vnkvstnk
|
July 26, 2019, 9:10 a.m. |
+ 2 |
for
First-frbrgeorge
|
July 17, 2019, 9:05 a.m. |
+ 3 |
for
grouper as Itertools Recipe-flpo
|
July 10, 2019, 9:40 a.m. |
+ 1 |
for
First-Satoshi_Ogata
|
June 26, 2019, 9:20 a.m. |
+ 1 |
for Comment
tanya: Good solution
|
June 24, 2019, 10:05 a.m. |
+ 2 |
for
reduce(gcd)-HeNeArKr
|
June 13, 2019, 9:16 a.m. |
+ 3 |
for
9-liner: short-przemyslaw.daniel
|
June 7, 2019, 1:52 p.m. |
+ 1 |
for Comment
massif1: Thanks for sharing this solution. It's a different approach than mine (Regex + Counter) and you only...
|
May 29, 2019, 1:40 p.m. |
+ 2 |
for
First-Ylliw
|
May 29, 2019, 1:36 p.m. |
+ 1 |
for Comment
VangaroooYamada: so simple
|
May 29, 2019, 1:27 p.m. |
+ 1 |
for Comment
aleksandr.zaytcev: password = '' dimension = len(cipher_grille) for x in range(dimension): password += ''.join([ciphere...
|
May 21, 2019, 8:55 a.m. |
+ 2 |
for
First-eugene100372
|
May 21, 2019, 8:21 a.m. |
+ 1 |
for Comment
dannedved: A clean, readable and well-documented solution.
|
May 16, 2019, 8:57 a.m. |
+ 1 |
for Comment
caitlan: clear
|
May 16, 2019, 8:42 a.m. |
+ 1 |
for Comment
suic: Hi, here's a bit shorter alternative: ```python import string def checkio(str_number, radix): d = di...
|
May 15, 2019, 1:20 p.m. |
+ 1 |
for Comment
pcresolver: I like that you describe the challenge so that we know what the code is doing.
|
May 14, 2019, 9:23 a.m. |
+ 1 |
for Comment
juestr: A few suggestions: - ```for row, line in enumerate(lines)```, manual counting isn't very pythonic - ...
|
May 4, 2019, 10:20 a.m. |
+ 1 |
for
First-dimitar.tonchev
|
April 30, 2019, 1:55 p.m. |
+ 1 |
for Comment
vtflnk: The best solution.
|
April 27, 2019, 9:51 a.m. |
+ 1 |
for Comment
Phil15: Private messages could be useful. You removed your entire forum post, not just the last comment. So ...
|
April 23, 2019, 9:45 a.m. |
+ 2 |
for
simplified-Olpag
|
April 13, 2019, 11 a.m. |
+ 1 |
for
simple with find-keneda212
|
April 10, 2019, 10:11 a.m. |
+ 1 |
for Comment
ayubutrym: In this case the division yields an integer result (it's the C_nm -- number of combinations) that's ...
|
April 9, 2019, 10:01 a.m. |
+ 1 |
for Comment
ayubutrym: Line 9 could use integer division `//` with the same effect of rounding to the nearest smallest inte...
|
April 4, 2019, 9:55 a.m. |
+ 2 |
for
numpy dot-fokusd
|
April 4, 2019, 8:40 a.m. |
+ 1 |
for Comment
alphamikevictor: Nice approach, It would be nice to take a look to [Python's all](https://docs.python.org/3/library/f...
|
March 28, 2019, 10:35 a.m. |
+ 1 |
for
First-chunshar
|
March 20, 2019, 2:25 p.m. |
+ 1 |
for Comment
qurutrevor: Very Pythonic.
|
March 14, 2019, 9:45 a.m. |
+ 3 |
for
BFS-fed.kz
|
March 8, 2019, 9:30 a.m. |
+ 3 |
for
First-mozurin
|
March 5, 2019, 9:22 a.m. |
+ 1 |
for Comment
przemyslaw.daniel: don't hesitate to upvote it then ;-)
|
Feb. 28, 2019, 2:15 p.m. |
+ 2 |
for
puzzling-Tical_1000
|
Feb. 25, 2019, 9:29 a.m. |
+ 1 |
for Comment
itheklon: You don need: if end_position < 0: end_position += (side-1)*4 if you use (number)%Z - you get a poit...
|
Feb. 20, 2019, 2:20 p.m. |
+ 1 |
for
First-Vasily__Chibilyaev
|
Feb. 19, 2019, 9:41 a.m. |
+ 1 |
for Comment
arthurdias-trad: Good, simple and clean solution. However, on the odd length solution, you don't need to add and subt...
|
Feb. 15, 2019, 2:33 p.m. |
+ 1 |
for
Unicode normalize-nakanohito_piyo
|
Feb. 15, 2019, 2:23 p.m. |
+ 2 |
for
First-Pouf
|
Feb. 13, 2019, 2:35 p.m. |
+ 1 |
for
All pairs of cities, all flights of minimal prices, multiple Dijkstra-Phil15
|
Feb. 12, 2019, 9:55 a.m. |
+ 1 |
for Comment
JimmyCarlos: This is a really clear and well put together solution, using simple maths to make a concise answer.
|
Feb. 12, 2019, 9:53 a.m. |
+ 1 |
for Comment
vit.aborigen: good comments
|
Feb. 1, 2019, 11:38 a.m. |
+ 4 |
for
re.match()-kurosawa4434
|
Feb. 1, 2019, 10:57 a.m. |
+ 2 |
for
meh-ssk8
|
Jan. 30, 2019, 10:15 a.m. |
+ 1 |
for
First-tigerhu3180
|
Jan. 29, 2019, 10:39 a.m. |
+ 2 |
for
... and that's how you use islice.-veky
|
Jan. 29, 2019, 10:34 a.m. |
+ 2 |
for
Generator yielding instructions-Leonix
|
Jan. 25, 2019, 9:50 a.m. |
+ 1 |
for
First (chain)-ssk8
|
Jan. 19, 2019, 10:36 a.m. |
+ 1 |
for Comment
Merzix: if (len([elem[0] for elem in pairs]) != len(set([elem[0] for elem in pairs]))): return False else: r...
|
Jan. 4, 2019, 11:25 a.m. |
+ 2 |
for
First-eugene100372
|
Jan. 4, 2019, 11:25 a.m. |
+ 2 |
for
First (list comprehension)-ssk8
|
Dec. 21, 2018, 10:55 a.m. |
+ 1 |
for Comment
BrianMcleod: This solution fails on assert can_balance([6,1,10,6,1]) == -1 It gives the answer 2
|
Dec. 15, 2018, 12:10 p.m. |
+ 1 |
for
One-line (itertools.chain.from_iterable)-fokusd
|
Dec. 15, 2018, 11:55 a.m. |
+ 1 |
for Comment
Phil15: There is also the "comprehension thing": n for start, stop in items for n in range(start, stop + 1)
|
Dec. 15, 2018, 11:37 a.m. |
+ 1 |
for Comment
Phil15: I started to think I would not see `list.extend(range(...))`. But you can unpack tuples from items b...
|
Dec. 10, 2018, 8:02 p.m. |
+ 1 |
for
First-tigerhu3180
|
Dec. 10, 2018, 7:07 p.m. |
+ 1 |
for Comment
tigerhu3180: For line 26-33, we have the same idea and here is my code. {i: True if i < len(items) - 1 and items[...
|
Dec. 10, 2018, 11:55 a.m. |
+ 1 |
for Comment
tokyoamado: @colinmcnicholl Thank you for comment. First, I'm no good with English so I afraid that I may misund...
|
Dec. 9, 2018, 7:50 p.m. |
+ 1 |
for
First-tokyoamado
|
Dec. 2, 2018, 4:42 p.m. |
+ 1 |
for
First-TianPu8153
|
Dec. 2, 2018, 4:40 p.m. |
+ 1 |
for
First-marcinokonek99
|
Dec. 2, 2018, 4:34 p.m. |
+ 2 |
for
First-Sillte
|
Dec. 2, 2018, 2:46 p.m. |
+ 1 |
for
5-liner: map point-przemyslaw.daniel
|
Nov. 16, 2018, 8:40 p.m. |
+ 1 |
for
First-Beo
|
Nov. 10, 2018, 8:15 p.m. |
+ 1 |
for
First-jakubsztyma
|
Nov. 4, 2018, 9:19 a.m. |
+ 1 |
for
First-hidebehind3
|
Nov. 2, 2018, 2:56 p.m. |
+ 1 |
for Comment
Phil15: return items == sorted(items) and not (len(items) > 1 and len(set(items)) == 1) is enough but False....
|
Nov. 1, 2018, 8:10 p.m. |
+ 1 |
for
First-chunshar
|
Oct. 25, 2018, 6:41 p.m. |
+ 1 |
for
One-liner-altarfinch
|
Oct. 17, 2018, 6:35 p.m. |
+ 1 |
for
First-Merzix
|
Oct. 16, 2018, 6 p.m. |
+ 1 |
for Comment
fed.kz: I noticed that your program does not work correctly for a string of 10 characters. braille_page('a'*...
|
Oct. 14, 2018, 8:16 p.m. |
+ 1 |
for Comment
Infini7y: Better... although use the list instead of assigning variables to each element. If your already work...
|
Oct. 10, 2018, 6:45 p.m. |
+ 1 |
for
First-islavunin
|
Oct. 4, 2018, 4:39 p.m. |
+ 1 |
for Comment
Phil15: Lines 15-20 in a else and 'return nothing' can disappear :) I never used collections.defaultdict yet...
|
Oct. 3, 2018, 7:44 p.m. |
+ 1 |
for Comment
Phil15: I put a special case when the given length is N**2, it's just the sum of all numbers. Well, it's tru...
|
Oct. 3, 2018, 7:39 p.m. |
+ 1 |
for Comment
swagg010164: If the path length is N^2 (3x3 - 9, 4x4 - 16, 5x5 - 25), then this is an exception and this algorith...
|