{"id":3540,"date":"2017-12-21T06:00:19","date_gmt":"2017-12-21T04:00:19","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=3540"},"modified":"2018-02-19T08:47:13","modified_gmt":"2018-02-19T06:47:13","slug":"sumable-sin-vecinos","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/sumable-sin-vecinos\/","title":{"rendered":"Sumable sin vecinos"},"content":{"rendered":"<p>En la lista [3,2,5,7,4] el n\u00famero 12 se puede escribir como una suma de elementos de la lista sin incluir sus vecinos (ya que es la suma de 3, 5 y 4); en cambio, 14 no lo es (porque es la suma de 3, 7 y 4, pero 7 y 4 son vecinos).<\/p>\n<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   esSumableSinVecinos :: [Int] -> Int -> Bool\n<\/pre>\n<p>tal que (esSumableSinVecinos xs n) se verifica si n se puede escribir como una suma de elementos de xs que no incluye a ninguno de sus vecinos. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   esSumableSinVecinos [3,2,5,7,4] 12  ==  True\n   esSumableSinVecinos [3,2,5,7,4] 9   ==  True\n   esSumableSinVecinos [3,2,5,7,4] 6   ==  True\n   esSumableSinVecinos [3,2,5,7,4] 14  ==  False\n   esSumableSinVecinos [3,2,5,7,4] 1   ==  False\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nesSumableSinVecinos :: [Int] -> Int -> Bool\nesSumableSinVecinos _  0       = True\nesSumableSinVecinos []  _      = False\nesSumableSinVecinos [x] n      = x == n\nesSumableSinVecinos (x:y:zs) n = esSumableSinVecinos zs (n - x) ||\n                                 esSumableSinVecinos (y:zs) n\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>En la lista [3,2,5,7,4] el n\u00famero 12 se puede escribir como una suma de elementos de la lista sin incluir sus vecinos (ya que es la suma de 3, 5 y 4); en cambio, 14 no lo es (porque es la suma de 3, 7 y 4, pero 7 y 4 son vecinos). Definir la&#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":[6],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3540"}],"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=3540"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3540\/revisions"}],"predecessor-version":[{"id":3801,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3540\/revisions\/3801"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=3540"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=3540"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=3540"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}