Choose n distinct number from n set

Revision en2, by Frez, 2015-10-01 22:55:46

Suppose we have n set of numbers . we want to choose a number from each set that they were distinct . how we can do it efficiently ?

A -> 1 <= n <= 20 , 1 <= |s| <= 100 , 1 <= numbers <= 10^9

B -> 1 <= n <= 10^5 , 1 <= |s| <= 10^5 , 1 <= numbers <= 10^9

C -> In General ?

thanks in advance.

Tags set, choose, discrete

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Frez 2015-10-01 22:55:46 6
en1 English Frez 2015-10-01 22:42:23 340 Initial revision (published)