Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Iportant first comment in the blog:

> Just to summarize how commenter, Jeffrey Shallit, addresses the (1, 3, 11, 37) solution: this is the best way to use the Greedy algorithm to select coins. However, (1, 5, 18, 25) and (1, 5, 18, 29) are tied for the actual solutions. [...]



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: