{"id":2808,"date":"2014-03-20T08:25:56","date_gmt":"2014-03-20T13:25:56","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2808"},"modified":"2026-04-05T17:43:06","modified_gmt":"2026-04-05T22:43:06","slug":"s1eva2011ti_t2-subasta-inversa","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-s1eva20\/s1eva2011ti_t2-subasta-inversa\/","title":{"rendered":"s1Eva2011TI_T2 Subasta Inversa"},"content":{"rendered":"\n<p><em><strong>Ejercicio<\/strong><\/em>: <a href=\"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-1eva20\/1eva2011ti_t2-subasta-inversa\/\" data-type=\"post\" data-id=\"3222\">1Eva2011TI_T2 Subasta Inversa<\/a><\/p>\n\n\n\n<p>Solicitar los datos de las ofertas por vendedor en un vector oferta(i)<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code><span style=\"color: #ff0000\"># INGRESO<\/span>\nn = <span style=\"color: #ff00ff\">int<\/span>(<span style=\"color: #ff00ff\">input<\/span>(<span style=\"color: #008000\">'cuantos ofertas:'<\/span>))\noferta = &#091;]\ni = 0\n<span style=\"color: #d35400\">while<\/span> i&lt;n:\n    pregunta = <span style=\"color: #008000\">'oferta&#091;'<\/span>+<span style=\"color: #ff00ff\">str<\/span>(i)+<span style=\"color: #008000\">']:'<\/span>\n    unaoferta = <span style=\"color: #ff00ff\">float<\/span>(<span style=\"color: #ff00ff\">input<\/span>(pregunta))\n    oferta.append(unaoferta)\n    i = i + 1<\/code><\/pre>\n\n\n\n<p>Use el algoritmo del menor para determinar al vendedor con menor valor de oferta.<\/p>\n\n\n\n<p>Identificado el vendedor menor, contar cu\u00e1ntos igualan la mejor oferta.<\/p>\n\n\n\n<p><span dir=\"ltr\" role=\"presentation\">Si el contador es mayor que 1, sortear entre los vendedores hasta que el sorteo recaiga en un vendedor que si cumpla.<\/span><\/p>\n\n\n\n<p>Mostrar los resultados<\/p>\n\n\n\n<p><strong>Tarea<\/strong>: convertir a instrucciones Python el siguiente diagrama de flujo:<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Diagrama de Flujo<\/h2>\n\n\n\n<figure class=\"wp-block-image aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"283\" height=\"565\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/diagramaSubastaInversa01.png\" alt=\"diagrama Subasta Inversa 01\" class=\"wp-image-19334\" \/><\/figure>\n\n\n\n<p><\/p>\n\n\n\n<figure class=\"wp-block-image aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"372\" height=\"648\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/diagramaSubastaInversa02.png\" alt=\"diagrama Subasta Inversa 02\" class=\"wp-image-19335\" \/><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Ejercicio: 1Eva2011TI_T2 Subasta Inversa Solicitar los datos de las ofertas por vendedor en un vector oferta(i) Use el algoritmo del menor para determinar al vendedor con menor valor de oferta. Identificado el vendedor menor, contar cu\u00e1ntos igualan la mejor oferta. Si el contador es mayor que 1, sortear entre los vendedores hasta que el sorteo [&hellip;]<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejemplos","format":"standard","meta":{"footnotes":""},"categories":[130],"tags":[58,157],"class_list":["post-2808","post","type-post","status-publish","format-standard","hentry","category-fp-s1eva20","tag-ejemplos-python","tag-fundamentos-programacion"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2808","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/users\/8043"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/comments?post=2808"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2808\/revisions"}],"predecessor-version":[{"id":23629,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2808\/revisions\/23629"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2808"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2808"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2808"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}