Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
guard-of-terra
on Feb 13, 2012
|
parent
|
context
|
favorite
| on:
The 17x17 problem solved
And the first rule would be "the elements have no bits in common, but together (ORed) they have all 17 bits" That's almost XOR(i in S) = -1 but not really
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
