{"id":6198,"date":"2021-03-22T06:00:14","date_gmt":"2021-03-22T04:00:14","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=6198"},"modified":"2021-03-29T11:58:39","modified_gmt":"2021-03-29T09:58:39","slug":"arbol-de-las-divisiones-por-2-3-o-5","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/arbol-de-las-divisiones-por-2-3-o-5\/","title":{"rendered":"\u00c1rbol de las divisiones por 2, 3 \u00f3 5"},"content":{"rendered":"<p>En la librer\u00eda <a href=\"http:\/\/bit.ly\/2mLEVg4\">Data.Tree<\/a> se definen los \u00e1rboles y los bosques como sigue<\/p>\n<pre lang=\"text\">\n   data Tree a   = Node a (Forest a)\n   type Forest a = [Tree a]\n<\/pre>\n<p>Se pueden definir \u00e1rboles. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   ej = Node 3 [Node 5 [Node 9 []], Node 7 []]\n<\/pre>\n<p>Y se pueden dibujar con la funci\u00f3n drawTree. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> putStrLn (drawTree (fmap show ej))\n   3\n   |\n   +- 5\n   |  |\n   |  `- 9\n   |\n   `- 7\n<\/pre>\n<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   arbolDivisiones :: Int -> Tree Int\n<\/pre>\n<p>tal que (arbolDivisiones x) es el \u00e1rbol de las divisiones enteras de x entre 2, 3 \u00f3 5. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> putStrLn (drawTree (fmap show (arbolDivisiones 20)))\n   20\n   |\n   +- 10\n   |  |\n   |  +- 5\n   |  |  |\n   |  |  `- 1\n   |  |\n   |  `- 2\n   |     |\n   |     `- 1\n   |\n   `- 4\n      |\n      `- 2\n         |\n         `- 1\n\n   \u03bb> putStrLn (drawTree (fmap show (arbolDivisiones 30)))\n   30\n   |\n   +- 15\n   |  |\n   |  +- 5\n   |  |  |\n   |  |  `- 1\n   |  |\n   |  `- 3\n   |     |\n   |     `- 1\n   |\n   +- 10\n   |  |\n   |  +- 5\n   |  |  |\n   |  |  `- 1\n   |  |\n   |  `- 2\n   |     |\n   |     `- 1\n   |\n   `- 6\n      |\n      +- 3\n      |  |\n      |  `- 1\n      |\n      `- 2\n         |\n         `- 1\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.Tree (Tree (Node), drawTree)\n\narbolDivisiones :: Int -> Tree Int\narbolDivisiones x =\n  Node x (map arbolDivisiones (divisiones x))\n\n-- (divisiones x) es la lista de las divisiones enteras de x entre 2, 3\n-- y 5. Por ejemplo,\n--    divisiones 30  ==  [15,10,6]\n--    divisiones 15  ==  [5,3]\ndivisiones :: Int -> [Int]\ndivisiones x =\n  [x `div` y | y <- [2,3,5], x `mod` y == 0]\n<\/pre>\n<h4>Nuevas soluciones<\/h4>\n<ul>\n<li>En los comentarios se pueden escribir nuevas soluciones.\n<li>El c\u00f3digo se debe escribir entre una l\u00ednea con &#60;pre lang=&quot;haskell&quot;&#62; y otra con &#60;\/pre&#62;\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>En la librer\u00eda Data.Tree se definen los \u00e1rboles y los bosques como sigue data Tree a = Node a (Forest a) type Forest a = [Tree a] Se pueden definir \u00e1rboles. Por ejemplo, ej = Node 3 [Node 5 [Node 9 []], Node 7 []] Y se pueden dibujar con la funci\u00f3n drawTree. Por ejemplo,&#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":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/6198"}],"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=6198"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/6198\/revisions"}],"predecessor-version":[{"id":6234,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/6198\/revisions\/6234"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=6198"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=6198"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=6198"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}