{"id":266,"date":"2022-05-10T11:41:47","date_gmt":"2022-05-10T09:41:47","guid":{"rendered":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/?p=266"},"modified":"2022-05-12T09:54:32","modified_gmt":"2022-05-12T07:54:32","slug":"programme-glouton","status":"publish","type":"post","link":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/2022\/05\/10\/programme-glouton\/","title":{"rendered":"ALGORITHMES GLOUTON"},"content":{"rendered":"\n<p>Dans le probl\u00e8me du rendu de monnaie , l&rsquo;algorithme consistant \u00e0 r\u00e9p\u00e9ter le choix de la pi\u00e8ce de plus grande valeur qui ne d\u00e9passe pas la somme restante. Le nom du programme est : algorithme glouton.<\/p>\n\n\n\n<p>objectif : <\/p>\n\n\n\n<ul><li>minimiser ou maximiser une fonction objectif<\/li><li>satisfaire une ou des fonctions contraintes (il existe des probl\u00e8mes avec ou sans contrainte).<\/li><\/ul>\n\n\n\n<p>ci dessous voici un lien google colab :<\/p>\n\n\n\n<p><a href=\"https:\/\/colab.research.google.com\/drive\/1PurgxvEo8IrvIqknp9u9SS4yIl98o1aF\">https:\/\/colab.research.google.com\/drive\/1PurgxvEo8IrvIqknp9u9SS4yIl98o1aF<\/a><\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">system_euro=[500,200,100,50,20,10,5,2,1]\ndef rendu_monnaie(somme,systeme):\n    liste_pieces=[]\n    for valeur in systeme:\n        while somme&gt;=valeur:\n            liste_pieces.append(valeur)\n            somme=somme-valeur\n    return liste_pieces<\/pre>\n\n\n\n<p>le programme permet de rendre la monnaie en fonction de l&rsquo;argent qui a \u00e9t\u00e9 donn\u00e9 pour un achat.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Dans le probl\u00e8me du rendu de monnaie , l&rsquo;algorithme consistant \u00e0 r\u00e9p\u00e9ter le choix de la pi\u00e8ce de plus grande valeur qui ne d\u00e9passe pas la somme restante. Le nom du programme est : algorithme glouton. objectif : minimiser ou maximiser une fonction objectif satisfaire une ou des fonctions contraintes (il existe des probl\u00e8mes avec [&hellip;]<\/p>\n","protected":false},"author":14,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"_links":{"self":[{"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/posts\/266"}],"collection":[{"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/users\/14"}],"replies":[{"embeddable":true,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/comments?post=266"}],"version-history":[{"count":8,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/posts\/266\/revisions"}],"predecessor-version":[{"id":280,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/posts\/266\/revisions\/280"}],"wp:attachment":[{"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/media?parent=266"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/categories?post=266"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/yb-isn.fr\/2021\/nsi\/jean-lou\/wp-json\/wp\/v2\/tags?post=266"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}