Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
dhouston
on July 9, 2007
|
parent
|
context
|
favorite
| on:
Java vs. K: a screencast
def birthday(people=23): from random import randint as rand; return sum([len(set([rand(1,365) for x in range(people)])) != people for i in range(1000)])
(constructs fewer inner lists, otherwise changes are completely cosmetic)
3KWA
on July 9, 2007
[–]
ah yes indeed much better! I tried to follow the K structure too much, but your code is too readable :D
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
(constructs fewer inner lists, otherwise changes are completely cosmetic)