57
Awesome Team
Vedran Čačić
https://web.math.hr/~veky
Last seen 15 hours ago
Member for 11 years, 6 months, 6 days
Difficulty Advanced
We shall not cease from exploration, and the end of all our exploring will be to arrive where we started and know the place for the first time.
Correct! :-)
Unfortunately, [there is no horse](http://web.mit.edu/adorai/www/hesaidshesaid.html). :-PP
More
Nice algo. A few Pythonic nitpickings:
* It would be nicer if tuples in q were (time, pos,...), then you could just sort them directly by time. Or if you want to be explicit, you could have used namedtuple.
* q.pop(0) is slow with no good reason to use it. It would be better to q.sort(reverse=True
More
Finally someone who used groupby correctly. :-D
You seem to have big problems with your iterators, since you're always trying to cram them into expressions. And map is not a panacea. :-)
daily_secs = ((int(r[2]) for r in records) for records in daily_records)
Or something like that. :-)
But
More
not cool but simple-kamitenshi
Not cool because quadratic. And comprehension would probably be simpler. :-)
More
Clear as the purest water-kamitenshi
I hope you're sarcastic with the title. :-P
First, "m" means precisely nothing. Just return it.
What's that for doing there??
-1 >= can be more simply written as >. Those are ints.
More
For beginners like me, easy to understand -kamitenshi
Beginners are strange. Beginners like you, even stranger. :-DD
Anyway, to make it easy to understand also for us poor gurus over here, you could:
* remove that trunc, it serves no purpose
* remove that list from line 2. It makes no sense to listify it, if the only thing you're going to do with it
More
It's almost object oriented. :-D
Mine is much simpler, without special methods with quite trivial implementations, and I think it does the same job. :-=
(Only 2 thumbs since you're writing FORTRAN in Python. But you already know that, probably.:)
More
> Python helps me to stay sane in this crazy world.
Ok, then maybe _don't_ read my solutions. :-D :-]
More
It seems I'm not the only one getting strange compliments on CiO. Python gets them too. :-D
More
I'm not absolutely sure, but I think Py2 also gives you better way of calling replace:
','.join(phrases).replace("right", "left")
More
Lines 5 and 7:
if i in "([{":
if i in ")]}":
Line 15: You can just
return not stack and not error
Or even `not (stack and error)` :-) But really, why error at all? It's not that you can recover anyway. When you find an error, don't set error to True, just `return False`. At the end,
More
Yeah, you should. :-D For start, study for-else loop. Much better than this insane flag manipulation.
More
Lambda-91 :/-zlomovsky
Nice solution. Shows how [DRY](http://www.checkio.org/mission/count-neighbours/publications/veky/python-3/around/?ordering=most_voted) is not always the same as shortest code. And I really like DRY more, but I do enjoy a game of golf here and there. Especially if [I win](http://www.checkio.org/missi
More
Really no need to use dt for two very different purposes. :-)
en = set()
for x in dt:
if x in lwr: en.add('a')
if x in upr: en.add('A')
if x in dig: en.add('0')
return (en, len(dt)) >= ({'a', 'A', '0'}, 10)
More
http://www.checkio.org/mission/super-root/publications/veky/python-3/utilities/?ordering=most_voted
Not complicated at all, just compressed. :-D
More
words.split() would probably be better.
Also, spaces. num += 1 and num = 0 are really much clearer, especially since you wrote it that way in line 2.
More
