timeles--S_O--dyssey's blog

By timeles--S_O--dyssey, history, 4 weeks ago, In English,

Given set of n(n <= 10**5) rectangles, find number of subset of rectangles of size m(m <= 5) such that no two rectangles in subset intersect. Coordinates of rectangles are <= 100.


4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by timeles--S_O--dyssey (previous revision, new revision, compare).