{"id":314,"date":"2014-06-16T06:00:36","date_gmt":"2014-06-16T04:00:36","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=314"},"modified":"2014-11-29T16:31:37","modified_gmt":"2014-11-29T14:31:37","slug":"divisores-de-un-numero-con-final-dado","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/divisores-de-un-numero-con-final-dado\/","title":{"rendered":"Divisores de un n\u00famero con final dado"},"content":{"rendered":"<h4>Enunciado<\/h4>\n<pre lang=\"text\">\n-- Definir la funci\u00f3n\n--    divisoresConFinal :: Integer -> Integer -> [Integer]\n-- tal que (divisoresConFinal n m) es la lista de los divisores de n\n-- cuyos d\u00edgitos finales coincide con m. Por ejemplo,\n--    divisoresConFinal 84 4    ==  [4,14,84]\n--    divisoresConFinal 720 20  ==  [20,120,720]\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\ndivisoresConFinal :: Integer -> Integer -> [Integer]\ndivisoresConFinal n m = \n    [x | x <- [1..n], n `rem` x == 0, final x m]\n\n--    final 325 5   ==  True\n--    final 325 25  ==  True\n--    final 325 35  ==  False\nfinal :: Integer -> Integer -> Bool\nfinal x y = take n xs == ys\n    where xs = reverse (show x)\n          ys = reverse (show y)\n          n  = length ys\n<\/pre>\n<h4>Referencias<\/h4>\n<p>El ejercicio est\u00e1 basado en el <a href=\"http:\/\/bit.ly\/1kVL56I\">problema 474<\/a> del <a href=\"https:\/\/projecteuler.net\">proyecto Euler<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Enunciado &#8212; Definir la funci\u00f3n &#8212; divisoresConFinal :: Integer -> Integer -> [Integer] &#8212; tal que (divisoresConFinal n m) es la lista de los divisores de n &#8212; cuyos d\u00edgitos finales coincide con m. Por ejemplo, &#8212; divisoresConFinal 84 4 == [4,14,84] &#8212; divisoresConFinal 720 20 == [20,120,720] Soluciones divisoresConFinal :: Integer -> Integer ->&#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":[5],"tags":[8,28,31,32,33],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/314"}],"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=314"}],"version-history":[{"count":5,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/314\/revisions"}],"predecessor-version":[{"id":689,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/314\/revisions\/689"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=314"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=314"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=314"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}