[Haskell-cafe] I need a hint in list processing

[Fernan Bolando]

On Sun, Jun 14, 2009 at 4:51 PM, Miguel Mitrofanov<miguelimo38 at yandex.ru> wrote:
> ghci> map reverse $ foldM (\answer list -> [x:answer | x <- list, not $ x
> `elem` answer]) [] [[2,3], [1,2], [2,3,4], [1,2,3]]
> [[2,1,4,3],[3,1,4,2],[3,2,4,1]]
>
> On 14 Jun 2009, at 12:06, Fernan Bolando wrote:
>
>> Hi all
>>
>> If I have a number of list
>> example
>> list1 = [2,3]
>> list2 = [1,2]
>> list3 = [2,3,4]
>> list4 = [1,2,3]
>>
>> I want to create a list from the list above with n elements,
>> non-repeating and each elements index represents 1 of the elements
>> from the corresponding list so for the above input I would get.
>>
>> a = [3,2,4,1]
>>
>> ofcourse there may be several set that will satisfy the problem, so a
>> list of list that satisfies would be good.
>>
>> How do I do this in haskell? or is there a code snippet that seems to
>> work similarly?
>>
>> thanks
>> fernan
>>
>> --
>> http://www.fernski.com
>> _______________________________________________
>> Haskell-Cafe mailing list
>> Haskell-Cafe at haskell.org
>> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>

thanks miguel
this is the one that I needed.

thanks also to everyone

fernan

-- 
http://www.fernski.com