[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[obm-l] posets
- To: obm-l@xxxxxxxxxxxxxx
- Subject: [obm-l] posets
- From: Tiago <jaspier@xxxxxxxxx>
- Date: Fri, 18 Nov 2005 02:48:15 -0200
- DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com; h=received:message-id:date:from:user-agent:x-accept-language:mime-version:to:subject:content-type:content-transfer-encoding; b=nHGD8E0y/PIwXlvv0mKAsC3sZvC+gjmWo269LU2VvLtCSs7OiTZuP7+O568P1fg4zdaEp69PD9nx+8GPzQjvG2YjankSdRBZa1rTEJ1tfAxqIm601O/eS0h8GGtS3GtmbJVduHDUCMxhnAlNlIeBPIx5ci7A1bnCfWYYeEch5RI=
- Reply-To: obm-l@xxxxxxxxxxxxxx
- Sender: owner-obm-l@xxxxxxxxxxxxxx
- User-Agent: Mozilla Thunderbird 1.0 (Windows/20041206)
dados dois posets(s, >=) e (t, <=). s = (1, 2, 3) e t = (1, 2, 3).
Ordene os pares (1,2), (2,3) , (2,1) de acordo com a ordem lexicografica
(s * t, < =).
Alguem pode me ajudar nessa questão? Obrigado
=========================================================================
Instruções para entrar na lista, sair da lista e usar a lista em
http://www.mat.puc-rio.br/~nicolau/olimp/obm-l.html
=========================================================================