{"id":3260,"date":"2014-03-13T08:00:46","date_gmt":"2014-03-13T13:00:46","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=3260"},"modified":"2025-12-10T11:39:48","modified_gmt":"2025-12-10T16:39:48","slug":"1eva2013tii_t1-verificar-bisiesto","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-1eva20\/1eva2013tii_t1-verificar-bisiesto\/","title":{"rendered":"1Eva2013TII_T1 Verificar Bisiesto"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"1EvaIIT2013\">1ra Evaluaci\u00f3n II T\u00e9rmino 2013-2014. Diciembre 3, 2013 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 1<\/strong> (15 puntos) En el calendario gregoriano, aplicable&nbsp; desde el a\u00f1o 704, un a\u00f1o es bisiesto si es divisible entre 4, a menos que sea divisible para 100. Pero un a\u00f1o tambi\u00e9n es bisiesto si es divisible para 100 y adem\u00e1s es divisible para 400.<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Por ejemplo: los a\u00f1os 1700, 1800, 1900 y 2100 no son bisiesto,\npero son bisiestos: 1600, 2000 y 2400.<\/code><\/pre>\n\n\n\n<p>Realice un algoritmo para determinar si un a\u00f1o dado, es o no bisiesto.<\/p>\n\n\n\n<p><strong>R\u00fabrica<\/strong>: ingreso y validaci\u00f3n (5 puntos), verificar bisiesto (8 puntos), bloque de salida (2 puntos)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>1ra Evaluaci\u00f3n II T\u00e9rmino 2013-2014. Diciembre 3, 2013 \/ICM00794 Tema 1 (15 puntos) En el calendario gregoriano, aplicable&nbsp; desde el a\u00f1o 704, un a\u00f1o es bisiesto si es divisible entre 4, a menos que sea divisible para 100. Pero un a\u00f1o tambi\u00e9n es bisiesto si es divisible para 100 y adem\u00e1s es divisible para 400. [&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":[115],"tags":[151,158],"class_list":["post-3260","post","type-post","status-publish","format-standard","hentry","category-fp-1eva20","tag-condicionales","tag-lazos-bucles"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3260","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=3260"}],"version-history":[{"count":2,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3260\/revisions"}],"predecessor-version":[{"id":16598,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3260\/revisions\/16598"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=3260"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=3260"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=3260"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}