This is a long-term (one month) programming contest. Definitely worth a look. Your job is to find an answer as good as possible to two hard problems.

- Find zero-one matrices that maximize
`(determinant / one_count`

;^{2}) - Find a linear zero-one system of equations with a single solution such that the closest root to 1 is as close as possible but not quite 1.

## No comments:

## Post a Comment

Note: (1) You need to have third-party cookies enabled in order to comment on Blogger. (2) Better to copy your comment before hitting publish/preview. Blogger sometimes eats comments on the first try, but the second works. Crazy Blogger.