<?xml version="1.0" encoding="UTF-8"?>
<lom:lom xmlns:lom="http://ltsc.ieee.org/xsd/LOM" xmlns:lomfr="http://www.lom-fr.fr/xsd/LOMFR" xmlns:unit="http://www.unit.eu/xsd/LOM"><lom:general><lom:identifier><lom:catalog>URI</lom:catalog><lom:entry>http://ori.unit-c.fr/uid/unit-ori-wf-1-4843</lom:entry></lom:identifier><lom:title><lom:string language="fre">Un algorithme de découpe de gâteau</lom:string></lom:title><lom:language>fre</lom:language><lom:description><lom:string language="fre">Dans Astérix et Cléopâtre, Obélix doit couper un gâteau en trois parts pour Astérix, Panoramix et lui. Équipé seulement d’un couteau, il coupe des parts très inégales... Mais comment couper en trois parts égales ?</lom:string></lom:description><lom:keyword><lom:string language="fre">algorithme</lom:string></lom:keyword><lom:keyword><lom:string language="fre">écriture binaire</lom:string></lom:keyword><lom:keyword><lom:string language="fre">calcul</lom:string></lom:keyword><lom:keyword><lom:string language="fre">fuscia</lom:string></lom:keyword><lom:structure><lom:source>LOMv1.0</lom:source><lom:value>atomic</lom:value></lom:structure><lom:aggregationLevel><lom:source>LOMv1.0</lom:source><lom:value>1</lom:value></lom:aggregationLevel><lomfr:documentType><lomfr:source>LOMv1.0</lomfr:source><lomfr:value>texte</lomfr:value></lomfr:documentType><lomfr:documentType><lomfr:source>LOMv1.0</lomfr:source><lomfr:value>image</lomfr:value></lomfr:documentType><lomfr:documentType><lomfr:source>LOMv1.0</lomfr:source><lomfr:value>ressource interactive</lomfr:value></lomfr:documentType></lom:general><lom:lifeCycle><lom:status><lom:source>LOMv1.0</lom:source><lom:value>final</lom:value></lom:status><lom:contribute><lom:role><lom:source>LOMv1.0</lom:source><lom:value>author</lom:value></lom:role><lom:entity>BEGIN:VCARD
VERSION:3.0
N:Boldo ;Sylvie
FN:Sylvie Boldo
EMAIL;TYPE=INTERNET:
ORG:INRIA
END:VCARD</lom:entity><lom:date><lom:dateTime>2010-05-27</lom:dateTime></lom:date></lom:contribute><lom:contribute><lom:role><lom:source>LOMv1.0</lom:source><lom:value>publisher</lom:value></lom:role><lom:entity>BEGIN:VCARD
VERSION:3.0
N:Institut National de Recherche en Informatique et en Automatique / Interstices
FN:Institut National de Recherche en Informatique et en Automatique / Interstices
URL: http://www.inria.fr
EMAIL;TYPE=internet:
ORG: INRIA
UID:0601223D
EMAIL;TYPE=INTERNET:
END:VCARD</lom:entity><lom:date><lom:dateTime>2010-07-22</lom:dateTime></lom:date></lom:contribute></lom:lifeCycle><lom:metaMetadata><lom:identifier><lom:catalog>URI</lom:catalog><lom:entry>http://ori.unit-c.fr/uid/unit-ori-wf-1-4844</lom:entry></lom:identifier><lom:contribute><lom:role><lom:source>LOMv1.0</lom:source><lom:value>creator</lom:value></lom:role><lom:entity>BEGIN:VCARD
N:Comte;Marie-Hélène
FN:Marie-Hélène Comte
EMAIL;TYPE=INTERNET:marie-helene.comte@inria.fr
ORG:INRIA/fuscia</lom:entity><lom:date><lom:dateTime>2010-07-22</lom:dateTime></lom:date></lom:contribute><lom:metadataSchema>LOMv1.0</lom:metadataSchema><lom:metadataSchema>LOMFRv1.0</lom:metadataSchema><lom:metadataSchema>SupLOMFRv1.0</lom:metadataSchema><lom:language>fre</lom:language></lom:metaMetadata><lom:technical><lom:format>text/html</lom:format><lom:location>http://interstices.info/jcms/i_54251/un-algorithme-de-decoupe-de-gateau</lom:location><lom:installationRemarks><lom:string language="fre"/></lom:installationRemarks></lom:technical><lom:educational><lom:learningResourceType><lom:source>LOMv1.0</lom:source><lom:value>lecture</lom:value></lom:learningResourceType><lom:learningResourceType><lom:source>LOMFRv1.0</lom:source><lom:value>démonstration</lom:value></lom:learningResourceType><lom:intendedEndUserRole><lom:source>LOMv1.0</lom:source><lom:value>learner</lom:value></lom:intendedEndUserRole><lom:context><lom:source>LOMv1.0</lom:source><lom:value>higher education</lom:value></lom:context><lom:typicalAgeRange><lom:string language="fre">18+</lom:string></lom:typicalAgeRange><lom:description><lom:string language="fre"/></lom:description><lom:language>fre</lom:language></lom:educational><lom:rights><lom:cost><lom:source>LOMv1.0</lom:source><lom:value>no</lom:value></lom:cost><lom:copyrightAndOtherRestrictions><lom:source>LOMv1.0</lom:source><lom:value>yes</lom:value></lom:copyrightAndOtherRestrictions><lom:description><lom:string language="fre">Ce document est diffusé sous licence Creative Common :
Paternité - Pas d'utilisation commerciale - Pas de modification. http://creativecommons.org/licenses/by-nc-nd/2.0/fr/legalcode </lom:string></lom:description></lom:rights><lom:annotation/><lom:classification><lom:purpose><lom:source>LOMv1.0</lom:source><lom:value>discipline</lom:value></lom:purpose><lom:taxonPath><lom:source><lom:string language="fre">Classification UNIT</lom:string></lom:source><lom:taxon><lom:id>1305</lom:id><lom:entry><lom:string language="fre">Programmation algorithmique, langage, conception objet, programmes</lom:string></lom:entry></lom:taxon></lom:taxonPath></lom:classification><lom:classification><lom:purpose><lom:source>LOMv1.0</lom:source><lom:value>discipline</lom:value></lom:purpose><lom:taxonPath><lom:source><lom:string language="fre">CDD 22e éd.</lom:string></lom:source><lom:taxon><lom:id>004.0151</lom:id><lom:entry><lom:string language="fre"/></lom:entry></lom:taxon></lom:taxonPath></lom:classification><unit:unit><unit:lmdLevel>L3</unit:lmdLevel></unit:unit></lom:lom>