{"id":2973,"date":"2014-07-03T13:30:34","date_gmt":"2014-07-03T18:30:34","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2973"},"modified":"2025-12-11T08:03:21","modified_gmt":"2025-12-11T13:03:21","slug":"2eva2011ti_t4-numeros-romanos-a-decimal","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva20\/2eva2011ti_t4-numeros-romanos-a-decimal\/","title":{"rendered":"2Eva2011TI_T4 N\u00fameros Romanos a decimal"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"2EvaIT2011\">2da Evaluaci\u00f3n I T\u00e9rmino 2011, Agosto 30, 2011 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 4<\/strong> (25 puntos). <\/p>\n\n\n\n<figure class=\"wp-block-image alignright size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"349\" height=\"182\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2015\/05\/RomanosNumeros01.png\" alt=\"Romanos N\u00fameros\" class=\"wp-image-16044\" \/><\/figure>\n\n\n\n<p>Realice un programa que reciba una cadena de caracteres, que representa un n\u00famero <strong>romano<\/strong> y la convierta a n\u00famero en base <strong>decimal<\/strong>.<\/p>\n\n\n\n<p>El equivalente de n\u00fameros romanos se muestra en la tabla, y para la conversi\u00f3n considere solo las siguientes reglas:<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><th>Romano<\/th><td>I<\/td><td>V<\/td><td>X<\/td><td>L<\/td><td>C<\/td><td>D<\/td><td>M<\/td><\/tr><tr><th>Decimal<\/th><td>1<\/td><td>5<\/td><td>10<\/td><td>50<\/td><td>100<\/td><td>500<\/td><td>1000<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Si a la derecha de una cifra romana de escribe otra igual o menor, el valor de \u00e9sta se suma a la anterior.<\/li>\n\n\n\n<li>Si entre dos cifras romanas cualesquiera existe otra menor, \u00e9sta restar\u00e1 su valor a la siguiente. Casos para I, X y C<\/li>\n\n\n\n<li>En ning\u00fan n\u00famero se puede poner una misma letra m\u00e1s de tres veces seguidas.<\/li>\n\n\n\n<li>Suponga que la cadena de caracteres corresponde a un n\u00famero romano v\u00e1lido.<\/li>\n<\/ul>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>Romano: CLXIII<\/td><td>&nbsp;<\/td><td>C<\/td><td>L<\/td><td>X<\/td><td>I<\/td><td>I<\/td><td>I<\/td><\/tr><tr><td>Decimal: 163<\/td><td>&nbsp;<\/td><td>+100<\/td><td>+50<\/td><td>+10<\/td><td>+1<\/td><td>+1<\/td><td>+1<\/td><\/tr><tr><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td>Romano: CXLIX<\/td><td>&nbsp;<\/td><td>C<\/td><td>X<\/td><td>L<\/td><td>I<\/td><td>X<\/td><td>&nbsp;<\/td><\/tr><tr><td>Decimal: 149<\/td><td>&nbsp;<\/td><td>+100<\/td><td>-10<\/td><td>+50<\/td><td>-1<\/td><td>+10<\/td><td>&nbsp;<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>R\u00fabrica<\/strong>: c\u00e1lculo de equivalencias aditivas (10 puntos), equivalencias con signo menos (15 puntos)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>2da Evaluaci\u00f3n I T\u00e9rmino 2011, Agosto 30, 2011 \/ICM00794 Tema 4 (25 puntos). Realice un programa que reciba una cadena de caracteres, que representa un n\u00famero romano y la convierta a n\u00famero en base decimal. El equivalente de n\u00fameros romanos se muestra en la tabla, y para la conversi\u00f3n considere solo las siguientes reglas: Romano [&hellip;]<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejercicios","format":"standard","meta":{"footnotes":""},"categories":[95],"tags":[149,150],"class_list":["post-2973","post","type-post","status-publish","format-standard","hentry","category-fp-2eva20","tag-arreglos-vectores","tag-cadenas"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2973","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=2973"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2973\/revisions"}],"predecessor-version":[{"id":16828,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2973\/revisions\/16828"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2973"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2973"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2973"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}