Choose n distinct number from n set

Правка en1, от Frez, 2015-10-01 22:42:23

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.

Теги set, choose, discrete

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Frez 2015-10-01 22:55:46 6
en1 Английский Frez 2015-10-01 22:42:23 340 Initial revision (published)