{"id":35766,"date":"2016-04-08T01:34:41","date_gmt":"2016-04-08T06:34:41","guid":{"rendered":"http:\/\/oscarbaezhack.wordpress.com\/?p=227"},"modified":"2016-04-08T02:34:08","modified_gmt":"2016-04-08T07:34:08","slug":"quiz05-5","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/quiz05-5\/","title":{"rendered":"#Quiz05"},"content":{"rendered":"<p>Hola a todos, el dia de hoy les traigo nuevo codigo, basicamente son 2 peque\u00f1os programas el primero determina si una palabra dada por el usuario es un palindromo y el segundo hace la suma de todos los numeros divisibles entre 3 dados por el usuario.<\/p>\n<p>Como de costumbre tuve problemas para realizar los programas, pero gracias a que me tope con un blog bastante\u00a0 bueno de una compa\u00f1era de clases, pude basarme en su estrucutra y sacar mi codigo adelante.<\/p>\n<p>Por cierto para los que se estan preguntando&#8230;\u00a0 Un pal\u00edndromo es una palabra, n\u00famero o frase que se lee igual hacia adelante que hacia atr\u00e1s. Si se trata de un n\u00famero, se llama capicu Habitualmente, las frases palindr\u00f3micas se resienten en su significado cuanto m\u00e1s largas son.<\/p>\n<p><a href=\"https:\/\/oscarbaezhack.wordpress.com\/2016\/04\/08\/quiz05\/#gallery-227-1-slideshow\">Haga click para ver el pase de diapositivas.<\/a><\/p>\n<p>Links de ayuda:<\/p>\n<p><a href=\"https:\/\/julesmdblog.wordpress.com\/\" rel=\"nofollow\">https:\/\/julesmdblog.wordpress.com\/<\/a><\/p>\n<p><a href=\"https:\/\/es.wikipedia.org\/wiki\/Pal%C3%ADndromo\" rel=\"nofollow\">https:\/\/es.wikipedia.org\/wiki\/Pal%C3%ADndromo<\/a><\/p>\n<p>Codigo:<\/p>\n<p><a href=\"https:\/\/github.com\/OscarBaez\/My-codes\/blob\/master\/Quiz5.cpp\" rel=\"nofollow\">https:\/\/github.com\/OscarBaez\/My-codes\/blob\/master\/Quiz5.cpp<\/a><\/p>\n<p><a href=\"https:\/\/github.com\/OscarBaez\/My-codes\/blob\/master\/Quizb.cpp\" rel=\"nofollow\">https:\/\/github.com\/OscarBaez\/My-codes\/blob\/master\/Quizb.cpp<\/a><\/p>\n<p>&nbsp;<\/p>\n<p>  <a rel=\"nofollow\" href=\"http:\/\/feeds.wordpress.com\/1.0\/gocomments\/oscarbaezhack.wordpress.com\/227\/\"><img decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/bbc0ed102f199ac3fe6d73328a7cf001.jpg\" \/><\/a> <img loading=\"lazy\" decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/a856ecddf89be123593104e5de1945e0.jpg#038;blog=105357316&#038;%23038;post=227&#038;%23038;subd=oscarbaezhack&#038;%23038;ref=&#038;%23038;feed=1\" width=\"1\" height=\"1\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hola a todos, el dia de hoy les traigo nuevo codigo, basicamente son 2 peque\u00f1os programas el primero determina si una palabra dada por el usuario es un palindromo y el segundo hace la suma de todos los numeros divisibles entre 3 dados por el usuario. Como de costumbre tuve problemas para realizar los programas, &hellip; <a href=\"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/quiz05-5\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">#Quiz05<\/span><\/a><\/p>\n","protected":false},"author":22,"featured_media":35795,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[209,45],"class_list":["post-35766","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-quiz5","tag-sin-categoria"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35766","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/users\/22"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=35766"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35766\/revisions"}],"predecessor-version":[{"id":35798,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35766\/revisions\/35798"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/35795"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=35766"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=35766"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=35766"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}