{"id":2117,"date":"2016-02-15T06:00:37","date_gmt":"2016-02-15T04:00:37","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=2117"},"modified":"2016-02-22T06:25:02","modified_gmt":"2016-02-22T04:25:02","slug":"numeros-como-suma-de-n-sumandos","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/numeros-como-suma-de-n-sumandos\/","title":{"rendered":"N\u00fameros como suma de N sumandos"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   sumas :: Int -> [Int] -> [Int]\n<\/pre>\n<p>tal que (sumas n xs) es la lista de los n\u00fameros que se pueden obtener como suma de n, o menos, elementos de xs. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   sumas 0 [2,5]              ==  [0]\n   sumas 1 [2,5]              ==  [0,2,5]\n   sumas 2 [2,5]              ==  [0,2,4,5,7,10]\n   sumas 3 [2,5]              ==  [0,2,4,5,6,7,9,10,12,15]\n   sumas 2 [2,3,5]            ==  [0,2,3,4,5,6,7,8,10]\n   sumas 3 [2,3,5]            ==  [0,2,3,4,5,6,7,8,9,10,11,12,13,15]\n   length (sumas 8 [1..200])  ==  1601\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.List (nub, sort)\n\nsumas :: Int -> [Int] -> [Int]\nsumas 0 _  = [0]\nsumas n xs = nub (sort (ys ++ [x+y | x <- xs, y <- ys]))\n    where ys = sumas (n-1) xs\n<\/pre>\n<h4>Soluci\u00f3n con Maxima<\/h4>\n<pre lang=\"maxima\">\nsumas (n,xs) := block ([ys],\n  if n > 0\n  then ( ys : sumas (n-1, xs),\n         unique (append (ys, create_list (x+y,x,xs,y,ys))) )\n  else [0])$\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n sumas :: Int -> [Int] -> [Int] tal que (sumas n xs) es la lista de los n\u00fameros que se pueden obtener como suma de n, o menos, elementos de xs. Por ejemplo, sumas 0 [2,5] == [0] sumas 1 [2,5] == [0,2,5] sumas 2 [2,5] == [0,2,4,5,7,10] sumas 3 [2,5] ==&#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,6,14],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2117"}],"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=2117"}],"version-history":[{"count":5,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2117\/revisions"}],"predecessor-version":[{"id":2157,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2117\/revisions\/2157"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=2117"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=2117"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=2117"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}