{"id":3728,"date":"2018-02-13T06:00:55","date_gmt":"2018-02-13T04:00:55","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=3728"},"modified":"2018-02-20T08:13:49","modified_gmt":"2018-02-20T06:13:49","slug":"menor-numero-divisible-por-10n-cuyos-digitos-suman-n","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/menor-numero-divisible-por-10n-cuyos-digitos-suman-n\/","title":{"rendered":"Menor n\u00famero divisible por 10^n cuyos d\u00edgitos suman n"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   menor :: Integer -> Integer\n<\/pre>\n<p>tal que (menor n) es el menor n\u00famero divisible por 10^n cuyos d\u00edgitos suman n. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   menor 5   ==  500000\n   menor 20  ==  29900000000000000000000\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.List (genericLength, genericReplicate)\n\nmenor :: Integer -> Integer\nmenor n = read (show (n-9*a) ++\n                genericReplicate a '9' ++\n                genericReplicate n '0')\n  where a = n `div` 9\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n menor :: Integer -> Integer tal que (menor n) es el menor n\u00famero divisible por 10^n cuyos d\u00edgitos suman n. Por ejemplo, menor 5 == 500000 menor 20 == 29900000000000000000000 Soluciones import Data.List (genericLength, genericReplicate) menor :: Integer -> Integer menor n = read (show (n-9*a) ++ genericReplicate a &#8216;9&#8217; ++ genericReplicate&#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":[30,175,95,33],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3728"}],"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=3728"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3728\/revisions"}],"predecessor-version":[{"id":3803,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3728\/revisions\/3803"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=3728"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=3728"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=3728"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}