{"id":4036,"date":"2018-05-04T06:00:52","date_gmt":"2018-05-04T04:00:52","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=4036"},"modified":"2018-05-11T17:02:04","modified_gmt":"2018-05-11T15:02:04","slug":"sucesiones-suaves","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/sucesiones-suaves\/","title":{"rendered":"Sucesiones suaves"},"content":{"rendered":"<p>Una sucesi\u00f3n es suave si valor absoluto de la diferencia de sus t\u00e9rminos consecutivos es 1.<\/p>\n<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   suaves :: Int -> [[Int]]\n<\/pre>\n<p>tal que (suaves n) es la lista de las sucesiones suaves de longitud n cuyo \u00faltimo t\u00e9rmino es 0. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   suaves 2  ==  [[1,0],[-1,0]]\n   suaves 3  ==  [[2,1,0],[0,1,0],[0,-1,0],[-2,-1,0]]\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nsuaves :: Int -> [[Int]]\nsuaves 0 = []\nsuaves 1 = [[0]]\nsuaves n = concat [[x+1:x:xs,x-1:x:xs] | (x:xs) <- suaves (n-1)] \n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Una sucesi\u00f3n es suave si valor absoluto de la diferencia de sus t\u00e9rminos consecutivos es 1. Definir la funci\u00f3n suaves :: Int -> [[Int]] tal que (suaves n) es la lista de las sucesiones suaves de longitud n cuyo \u00faltimo t\u00e9rmino es 0. Por ejemplo, suaves 2 == [[1,0],[-1,0]] suaves 3 == [[2,1,0],[0,1,0],[0,-1,0],[-2,-1,0]] Soluciones suaves&#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":[12,6],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/4036"}],"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=4036"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/4036\/revisions"}],"predecessor-version":[{"id":4068,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/4036\/revisions\/4068"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=4036"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=4036"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=4036"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}