On May 25, 1:13 pm, "Martin v. Löwis" <[EMAIL PROTECTED]> wrote: > > We can use any operation or function which > > takes and returns sets. > > I think the problem is significantly underspecified. It would be a more > interesting problem if there was a restriction to a few selected set > operations, e.g. union, intersection, difference, and combinations > thereof.
Ok, that's quite right -- when I just tried to define "any function," I found that all the solutions I came up with were combinations of the set operations defined for immutable sets. Let me improve the spec as the following: There may be arbitrarily many set elements (denoted by integers 1,2,3,...), arbitrarily many combinations of the elements composing the sets s_i (s0, s1, ...). We can use any of python's set operations or combination of those operations. Thanks for the clarification -- PB. -- http://mail.python.org/mailman/listinfo/python-list
