{"id":2812,"date":"2014-03-22T07:55:04","date_gmt":"2014-03-22T12:55:04","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2812"},"modified":"2026-10-14T06:39:45","modified_gmt":"2026-10-14T11:39:45","slug":"s1eva2012ti_t1-codificar-numero-por-digito","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-s1eva20\/s1eva2012ti_t1-codificar-numero-por-digito\/","title":{"rendered":"s1Eva2012TI_T1 Codificar n\u00famero por d\u00edgito"},"content":{"rendered":"\n<p><em><strong>Ejercicio<\/strong><\/em>: <a href=\"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-1eva20\/1eva2012ti_t1-codificar-numero-por-digito\/\" data-type=\"post\" data-id=\"3236\">1Eva2012TI_T1 Codificar n\u00famero por d\u00edgito<\/a><\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<div class=\"wp-block-group has-medium-font-size is-layout-flex wp-block-group-is-layout-flex\">\n<p><a href=\"#algoritmo\">algoritmo<\/a><\/p>\n\n\n\n<p><a href=\"#diagramaflujo\">diagrama flujo<\/a><\/p>\n<\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<figure class=\"wp-block-image alignleft size-full is-resized\"><img loading=\"lazy\" decoding=\"async\" width=\"690\" height=\"335\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/HerramientasDescifradoRansomwares.jpg\" alt=\"dibujo candado digital\" class=\"wp-image-16566\" style=\"width:300px\" \/><\/figure>\n\n\n\n<p>Considere que:<\/p>\n\n\n\n<p>a) Si el <strong>d\u00edgito<\/strong> de dicho n\u00famero es 2, 5 o 7, se le debe sumar la unidad.<\/p>\n\n\n\n<p>b) Si el <strong>d\u00edgito<\/strong> es 1, 4, 8 o 9, se le resta la unidad.<\/p>\n\n\n\n<p>c) Los <strong>d\u00edgitos<\/strong> restantes no se alteran.<\/p>\n\n\n\n<p>Ingrese un numero \"original\" validando que sea de tres d\u00edgitos, es decir entre 100 y 1000.<\/p>\n\n\n\n<p>Se extrae cada d\u00edgito usando residuo y cociente de la divisi\u00f3n para 10.<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: python; first-line: 15; title: ; notranslate\" title=\"\">\nd = A%10 \nA = A\/\/10\n<\/pre><\/div>\n\n\n<p>Aplique a cada d\u00edgito las reglas del enunciado del problema usando condicionales.<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: python; first-line: 18; title: ; notranslate\" title=\"\">\n    if (d==2 or d==5 or d==7):\n        d = d+1\n    else:\n        if (d==1 or d==4 or d==8 or d==9):\n            d = d-1\n<\/pre><\/div>\n\n\n<p>Los d\u00edgitos se vuelven a armar en el c\u00f3digo como resultado usando las posiciones i de cada uno de ellos (unidades, decenas, centenas).<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: python; first-line: 24; title: ; notranslate\" title=\"\">\n    codigo = codigo + d*(10**i)\n    i = i+1\n<\/pre><\/div>\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<div class=\"wp-block-group has-medium-font-size is-layout-flex wp-block-group-is-layout-flex\">\n<p><a href=\"#algoritmo\">algoritmo<\/a><\/p>\n\n\n\n<p><a href=\"#diagramaflujo\">diagrama flujo<\/a><\/p>\n<\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"algoritmo\">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# 1Eva_IT2012_T1 Codificar n\u00famero por d\u00edgito\n\n# INGRESO\noriginal = int(input('n\u00famero: '))\n\nwhile not(original&gt;=100 and original&lt;1000):\n    original = int(input('n\u00famero: '))\n\n# PROCEDIMIENTO\nA = original\ncodigo = 0\ni = 0\nwhile not(A==0):\n    d = A%10\n    A = A\/\/10\n    \n    if (d==2 or d==5 or d==7):\n        d = d+1\n    else:\n        if (d==1 or d==4 or d==8 or d==9):\n            d = d-1\n\n    codigo = codigo + d*(10**i)\n    i = i+1\n    \n# SALIDA\nprint('codificado: ', codigo)\n<\/pre><\/div>\n\n\n<p>Resultado del algoritmo<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>n\u00famero: 472\ncodificado:  383\n&gt;&gt;&gt; \nn\u00famero: 503\ncodificado:  603\n&gt;&gt;&gt; \nn\u00famero: 615\ncodificado:  606\n&gt;&gt;&gt; <\/code><\/pre>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<div class=\"wp-block-group has-medium-font-size is-layout-flex wp-block-group-is-layout-flex\">\n<p><a href=\"#algoritmo\">algoritmo<\/a><\/p>\n\n\n\n<p><a href=\"#diagramaflujo\">diagrama flujo<\/a><\/p>\n<\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"diagramaflujo\">Diagrama de Flujo<\/h2>\n\n\n\n<p>&nbsp;<\/p>\n\n\n\n<figure class=\"wp-block-image aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"357\" height=\"325\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/diagramaCodificarNumero01.png\" alt=\"diagrama Codificar N\u00famero 01\" class=\"wp-image-19347\" \/><\/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=\"385\" height=\"615\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/diagramaCodificarNumero02.png\" alt=\"diagramaCodificarNumero02\" class=\"wp-image-19346\" \/><\/figure>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<div class=\"wp-block-group has-medium-font-size is-layout-flex wp-block-group-is-layout-flex\">\n<p><a href=\"#algoritmo\">algoritmo<\/a><\/p>\n\n\n\n<p><a href=\"#diagramaflujo\">diagrama flujo<\/a><\/p>\n<\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n","protected":false},"excerpt":{"rendered":"<p>Ejercicio: 1Eva2012TI_T1 Codificar n\u00famero por d\u00edgito algoritmo diagrama flujo Considere que: a) Si el d\u00edgito de dicho n\u00famero es 2, 5 o 7, se le debe sumar la unidad. b) Si el d\u00edgito es 1, 4, 8 o 9, se le resta la unidad. c) Los d\u00edgitos restantes no se alteran. Ingrese un numero \"original\" [&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-2812","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\/2812","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=2812"}],"version-history":[{"count":6,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2812\/revisions"}],"predecessor-version":[{"id":26307,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2812\/revisions\/26307"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2812"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2812"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2812"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}