Can someone hint me on this problem

Revision en2, by SPyofgame, 2020-06-21 13:15:52

There is an empty rectangle of size

$$$n \times m$$$

where

$$$1 \leq n, m \leq 10^6$$$

We cover the rectangles k times from (u1, v1) to (u2, v2), where

$$$1 \leq k \leq 400$$$
$$$1 \leq u1 \leq u2 \leq n$$$
$$$1 \leq v1 \leq v2 \leq m$$$

The question is: How many squares of that rectangle have been covered ?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English SPyofgame 2020-06-21 13:15:52 9 Tiny change: 'times m$$ $$1 \leq ' -> 'times m$$ where $$1 \leq '
en1 English SPyofgame 2020-06-21 13:14:53 337 Initial revision (published)