{"id":9686,"date":"2015-01-04T13:54:45","date_gmt":"2015-01-04T18:54:45","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/ccpg1001\/?p=9686"},"modified":"2026-04-05T18:09:54","modified_gmt":"2026-04-05T23:09:54","slug":"s2eva2014tii_t2-listar-multas-infractores-metrovia","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-s2eva20\/s2eva2014tii_t2-listar-multas-infractores-metrovia\/","title":{"rendered":"s2Eva2014TII_T2 Listar multas infractores metrov\u00eda"},"content":{"rendered":"\n<p><strong><em>Ejercicio<\/em><\/strong>: <a href=\"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva20\/2eva2014tii_t2-listar-multas-infractores-metrovia\/\" data-type=\"post\" data-id=\"3025\">2Eva2014TII_T2 Listar multas infractores metrov\u00eda<\/a><\/p>\n\n\n\n<p>continuaci\u00f3n del tema 1. Propuesta de soluci\u00f3n en <strong>Python<\/strong>:<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Algoritmo en Python<\/h2>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: python; title: ; notranslate\" title=\"\">\n# ICM00794-Fundamentos de Computaci\u00f3n - FCNM-ESPOL\n# 2Eva_IIT2014_T2 Listar multas infractores metrov\u00eda\n# Tarea: Calcular el total de multas a recaudar\nimport numpy as np\n\ndef multametrovia(veces,basico):\n    pagar = 0\n    i = 1\n    while not(i&gt;veces):\n        if (i==1):\n            pagar = basico + 0.1*basico\n        if (i&gt;1):\n            pagar = pagar + 2*basico+0.1*basico\n        i = i + 1\n    return(pagar)\n\n# 2Eva_IIT2014_T2 Listar multas infractores metrov\u00eda\n# usa la funcion anterior\n\n# INGRESO\nn = int(input('cuantas infracciones: '))\ni = 0\ncodigo = &#x5B;]\nwhile not(i&gt;=n):\n    placa = input('codigo: ')\n    codigo.append(placa)\n    i = i + 1\n\n# PROCEDIMIENTO\n\n# marcar los \u00fanicos\nunico = np.ones(n,dtype=int)\ni = 0\npenultimo = n-1\nwhile not(i&gt;=penultimo):\n    j = i + 1\n    while not(j&gt;=n):\n        if (codigo&#x5B;i]==codigo&#x5B;j]):\n            unico&#x5B;j] = 0 \n        j = j + 1\n    i = i + 1\n\n# copiar en nueva lista placas \u00fanicas\ninfractor = &#x5B;]\ni = 0\nwhile not(i&gt;=n):\n    if (unico&#x5B;i]==1):\n        infractor.append(codigo&#x5B;i])\n    i = i + 1\n\n# contar los repetidos vector veces\nm = len(infractor)\nveces = np.zeros(m,dtype=int)\ni = 0\nwhile not(i&gt;=n):\n    placa = codigo&#x5B;i]\n    \n    # busca en infractores\n    j = 0\n    while not(j&gt;=m):\n        if (placa==infractor&#x5B;j]):\n            veces&#x5B;j] = veces&#x5B;j] + 1\n        j = j + 1\n    i = i + 1\n\n# multas\nmultas = np.zeros(m,dtype=float)\nj = 0\nwhile not(j&gt;=m):\n    multas&#x5B;j] = multametrovia(veces&#x5B;j],354)\n    j = j + 1\n\n# Tarea: total a recaudar por multas\n\n# SALIDA\nprint(unico)\nprint(infractor)\nprint('La lista de infractores y multas es:')\nj = 0\nwhile not(j&gt;=m):\n    print(infractor&#x5B;j],multas&#x5B;j])\n    j = j + 1\n<\/pre><\/div>\n\n\n<p>resultado del algoritmo<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>cuantas infracciones: 4\ncodigo: 123\ncodigo: 456\ncodigo: 1020\ncodigo: 456\n&#091;1 1 1 0]\n&#091;'123', '456', '1020']\nLa lista de infractores y multas es:\n123 389.4\n456 1132.8000000000002\n1020 389.4\n&gt;&gt;&gt; <\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Ejercicio: 2Eva2014TII_T2 Listar multas infractores metrov\u00eda continuaci\u00f3n del tema 1. Propuesta de soluci\u00f3n en Python: Algoritmo en Python resultado del algoritmo<\/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":[136],"tags":[58,157],"class_list":["post-9686","post","type-post","status-publish","format-standard","hentry","category-fp-s2eva20","tag-ejemplos-python","tag-fundamentos-programacion"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/9686","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=9686"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/9686\/revisions"}],"predecessor-version":[{"id":23697,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/9686\/revisions\/23697"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=9686"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=9686"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=9686"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}