| Nov. 29, 2013, 12:48 p.m. |
+ 1 |
for Comment
vakninir: Well it can be a lot of things - as already stated by others - Go, Chess, Checkers... but - that is ...
|
| Nov. 28, 2013, 1:43 p.m. |
+ 1 |
for Comment
floord: "like machine and man learning each other out" This sounds totally powerful and cool!
|
| Nov. 28, 2013, 1:43 p.m. |
+ 1 |
for Comment
vakninir: Oh my god - having the challenge be finding bugs in code is a good idea - but the brilliant idea - i...
|
| Nov. 26, 2013, 9:27 p.m. |
+ 1 |
for Comment
kermit666: Sounds cool. You could make duels in how quickly can people find a but in some seemingly-completed f...
|
| Nov. 26, 2013, 9:23 p.m. |
+ 1 |
for Comment
Lingson: Also volunteering for beta testing.
|
| Nov. 26, 2013, 9:23 p.m. |
+ 1 |
for Comment
bigblind: You could have players make AI's for many 2 player games where both programs take turs, such as Batt...
|
| Nov. 26, 2013, 3:56 p.m. |
+ 1 |
for Post
How do you compete?
|
| Nov. 26, 2013, 7:32 a.m. |
+ 1 |
for Comment
veky: Thanks. As I said many times, the less you write, the less the interpreter has to chow on. And it's ...
|
| Nov. 26, 2013, 7:32 a.m. |
+ 1 |
for Comment
A_bak_cfff596eda7840afb01132b2: Also it's the fastest one. I tried to compare this solution to other "Editor choices", and this one ...
|
| Nov. 22, 2013, 9:25 a.m. |
+ 1 |
for
 Shortest-veky
|
| Nov. 22, 2013, 7:53 a.m. |
+ 1 |
for Comment
bryukh: I think the problem with serialization of data. In your solution, the function return not boolean da...
|
| Nov. 21, 2013, 3:46 p.m. |
+ 1 |
for
 First-sakis21
|
| Nov. 21, 2013, 11:45 a.m. |
+ 1 |
for Comment
RyanLee: If only I knew there was a sort attribute for list data…very clever indeed!
|
| Nov. 21, 2013, 11:45 a.m. |
+ 1 |
for
Insertion sort-julianf
|
| Nov. 21, 2013, 11:43 a.m. |
+ 1 |
for Comment
julianf: sd = sorted(data) Once again, I wish I knew that function before trying to solve this task.
|
| Nov. 21, 2013, 11:43 a.m. |
+ 1 |
for
First-AndriusMk
|
| Nov. 21, 2013, 11:43 a.m. |
+ 1 |
for Comment
gcolle: Cool solution :) You can also check my lambda solution if wou want
|
| Nov. 21, 2013, 11:21 a.m. |
+ 1 |
for Comment
dadeap: ok that's how it works here ;p
|
| Nov. 21, 2013, 11:21 a.m. |
+ 1 |
for
 ~Shortest-veky
|
| Nov. 21, 2013, 11:21 a.m. |
+ 1 |
for Comment
floord: Maybe it's UI. But I guess a large part is also behavior driven. We can work on a culture where givi...
|
| Nov. 21, 2013, 11:20 a.m. |
+ 1 |
for Comment
veky: For me, it's other way around: "why use def when you can use lambda?". :-]] Namely, you can use def ...
|
| Nov. 21, 2013, 10:59 a.m. |
+ 1 |
for Comment
veky: Of course. If you haven't seen that one before, I bet you'd consider this one reasonably short. :-) ...
|
| Nov. 21, 2013, 10:56 a.m. |
+ 1 |
for Comment
nickie: This solution runs in O(n^2) time, as it's traversing the list once for each one of its elements. Yo...
|
| Nov. 21, 2013, 10:54 a.m. |
+ 1 |
for Comment
veky: Depends on your expectations. This isn't short enough for you? :-)
|
| Nov. 21, 2013, 10:52 a.m. |
+ 1 |
for
First-entibasse
|
| Nov. 21, 2013, 10:51 a.m. |
+ 1 |
for
First-ramovsky
|
| Nov. 21, 2013, 10:50 a.m. |
+ 1 |
for
O(n) :-P-veky
|
| Nov. 21, 2013, 10:48 a.m. |
+ 1 |
for Comment
kermit666: nonunique = Counter(data) - Counter(set(data)) Nice one. Didn't know about the Counter class before.
|
| Nov. 21, 2013, 10:47 a.m. |
+ 1 |
for Comment
abesto: Are you sure this is O(n)? d.count(x) counts the number of times x occurs in d for each element of d...
|
