{"id":6609,"date":"2022-02-14T06:00:46","date_gmt":"2022-02-14T04:00:46","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=6609"},"modified":"2022-02-23T19:04:00","modified_gmt":"2022-02-23T17:04:00","slug":"caminos-en-un-triangulo","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/caminos-en-un-triangulo\/","title":{"rendered":"Caminos en un tri\u00e1ngulo"},"content":{"rendered":"

Los tri\u00e1ngulos se pueden representar mediante listas de listas. Por ejemplo, el tri\u00e1ngulo<\/p>\n

\n      3\n     7 4\n    2 4 6\n   8 5 9 3\n<\/pre>\n
se representa por<\/p>\n
\n   [[3],[7,4],[2,4,6],[8,5,9,3]]\n<\/pre>\n
Definir la funci\u00f3n<\/p>\n
\n   caminos :: [[a]] -> [[a]]\n<\/pre>\n
tal que (caminos xss) es la lista de los caminos en el tri\u00e1ngulo xss donde los caminos comienzan en el elemento de la primera fila, en cada paso se mueve a uno de  sus dos elementos adyacentes en la fila siguiente y terminan en la \u00faltima fila. Por ejemplo,<\/p>\n
\n   \u03bb> caminos [[3],[7,4]]\n   [[3,7],[3,4]]\n   \u03bb> caminos [[3],[7,4],[2,4,6]]\n   [[3,7,2],[3,7,4],[3,4,4],[3,4,6]]\n   \u03bb> caminos [[3],[7,4],[2,4,6],[8,5,9,3]]\n   [[3,7,2,8],[3,7,2,5],[3,7,4,5],[3,7,4,9],[3,4,4,5],[3,4,4,9],[3,4,6,9],[3,4,6,3]]\n<\/pre>\n
Soluciones<\/h4>\n
\ncaminos :: [[a]] -> [[a]]\ncaminos []    = [[]]\ncaminos [[x]] = [[x]]\ncaminos ([x]:[y1,y2]:zs) =\n  [x:y1:us | (_:us) <- caminos ([y1] : map init zs)] ++\n  [x:y2:vs | (_:vs) <- caminos ([y2] : map tail zs)]\n<\/pre>\n
El c\u00f3digo se encuentra en GitHub<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"
Los tri\u00e1ngulos se pueden representar mediante listas de listas. Por ejemplo, el tri\u00e1ngulo 3 7 4 2 4 6 8 5 9 3 se representa por [[3],[7,4],[2,4,6],[8,5,9,3]] Definir la funci\u00f3n caminos :: [[a]] -> [[a]] tal que (caminos xss) es la lista de los caminos en el tri\u00e1ngulo xss donde los caminos comienzan en el…<\/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":[2],"tags":[8,6],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/6609"}],"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=6609"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/6609\/revisions"}],"predecessor-version":[{"id":6701,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/6609\/revisions\/6701"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=6609"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=6609"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=6609"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}