Since N is at most 60, an O(N^3) algorithm should be fast enough (you
can probably do better, this is just a straightforward solution).
Let sum(i, j) = the sum of all cells in the rectangle spanning rows 1
through i, and columns 1 through j (that is, the rectangle with upper
left corner at cell
Oops, please ignore. I did not notice that you were not talking about
the first problem on that page.
On Feb 6, 3:51 pm, dor [EMAIL PROTECTED] wrote:
Since N is at most 60, an O(N^3) algorithm should be fast enough (you
can probably do better, this is just a straightforward solution).
Let
On Feb 6, 12:30 pm, robin [EMAIL PROTECTED] wrote:
Hi
I was trying to solve problem number 5 from 15th bulgarian
informatics
olympiad.
on the following website:
http://www.math.bas.bg/bcmi/noi99.html
(we have to find the minimum and maximum possible values of numbers
on
the star
OK, problem 5 yes? (hopefully I got it right this time). Very cute
problem, by the way.
I thought about a solution that seems tedious to prove (if it's
actually correct). I did not prove it myself, so this might be totally
bogus. So be on the lookout for easy counterexamples.
OK, here is the
