{"id":1679,"date":"2015-11-05T06:00:37","date_gmt":"2015-11-05T04:00:37","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=1679"},"modified":"2021-04-25T17:10:32","modified_gmt":"2021-04-25T15:10:32","slug":"capicuas-productos-de-dos-numeros-de-dos-digitos-2015","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/capicuas-productos-de-dos-numeros-de-dos-digitos-2015\/","title":{"rendered":"Capic\u00faas productos de dos n\u00fameros de dos d\u00edgitos"},"content":{"rendered":"<p>El n\u00famero 9009 es capic\u00faa y es producto de dos n\u00fameros de dos d\u00edgitos, pues 9009 = 91*99.<\/p>\n<p>Definir la lista<\/p>\n<pre lang=\"text\">\n   capicuasP2N2D :: [Int]\n<\/pre>\n<p>cuyos elementos son los n\u00fameros capic\u00faas que son producto de 2 n\u00fameros de dos d\u00edgitos. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   take 5  capicuasP2N2D  ==  [121,242,252,272,323]\n   length  capicuasP2N2D  ==  74\n   drop 70 capicuasP2N2D  ==  [8008,8118,8448,9009]\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.List\n\ncapicuasP2N2D :: [Int]\ncapicuasP2N2D = [x | x <- productos, esCapicua x]\n\n-- productos es la lista de n\u00fameros menores que son productos de 2\n-- n\u00fameros de dos d\u00edgitos.  \nproductos :: [Int]\nproductos = sort (nub [x*y | x <- [10..99], y <- [x..99]])\n\n-- (esCapicua x) se verifica si x es capic\u00faa.\nesCapicua :: Int -> Bool\nesCapicua x = xs == reverse xs\n    where xs = show x\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>El n\u00famero 9009 es capic\u00faa y es producto de dos n\u00fameros de dos d\u00edgitos, pues 9009 = 91*99. Definir la lista capicuasP2N2D :: [Int] cuyos elementos son los n\u00fameros capic\u00faas que son producto de 2 n\u00fameros de dos d\u00edgitos. Por ejemplo, take 5 capicuasP2N2D == [121,242,252,272,323] length capicuasP2N2D == 74 drop 70 capicuasP2N2D == [8008,8118,8448,9009]&#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":[8,24,32,33,14],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1679"}],"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=1679"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1679\/revisions"}],"predecessor-version":[{"id":1712,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1679\/revisions\/1712"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=1679"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=1679"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=1679"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}