{"id":527,"date":"2014-10-31T07:00:38","date_gmt":"2014-10-31T05:00:38","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=527"},"modified":"2021-04-25T17:08:33","modified_gmt":"2021-04-25T15:08:33","slug":"listas-equidigitales-2014","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/listas-equidigitales-2014\/","title":{"rendered":"Listas equidigitales"},"content":{"rendered":"<h4>Enunciado<\/h4>\n<pre lang=\"text\">\n-- Una lista de n\u00fameros naturales es equidigital si todos sus elementos\n-- tienen el mismo n\u00famero de d\u00edgitos.\n-- \n-- Definir la funci\u00f3n\n--    equidigital :: [Int] -> Bool\n-- tal que (equidigital xs) se verifica si xs es una lista equidigital. \n-- Por ejemplo,\n--    equidigital [343,225,777,943]   ==  True\n--    equidigital [343,225,777,94,3]  ==  False\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\n-- 1\u00aa definici\u00f3n (por comprensi\u00f3n)\nequidigital :: [Int] -> Bool\nequidigital []     = True\nequidigital (x:xs) = and [nCifras y == n | y <- xs]\n    where n = nCifras x\n\n-- (nCifras x) es el n\u00famero de cifras de x. Por ejemplo,\n--    nCifras 475  ==  3\nnCifras :: Int -> Int\nnCifras x = length (show x)\n\n-- 2\u00aa definici\u00f3n (por recursi\u00f3n)\nequidigital2 :: [Int] -> Bool\nequidigital2 (x:y:zs) = nCifras x == nCifras y && equidigital (y:zs)\nequidigital2 _        = True\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Enunciado &#8212; Una lista de n\u00fameros naturales es equidigital si todos sus elementos &#8212; tienen el mismo n\u00famero de d\u00edgitos. &#8212; &#8212; Definir la funci\u00f3n &#8212; equidigital :: [Int] -> Bool &#8212; tal que (equidigital xs) se verifica si xs es una lista equidigital. &#8212; Por ejemplo, &#8212; equidigital [343,225,777,943] == True &#8212; equidigital [343,225,777,94,3]&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[4],"tags":[100,8,28,6,33],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/527"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=527"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/527\/revisions"}],"predecessor-version":[{"id":751,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/527\/revisions\/751"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=527"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=527"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=527"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}