{"id":1629,"date":"2015-10-26T07:46:40","date_gmt":"2015-10-26T05:46:40","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=1629"},"modified":"2015-11-02T06:37:12","modified_gmt":"2015-11-02T04:37:12","slug":"mayor-resto","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/mayor-resto\/","title":{"rendered":"Mayor resto"},"content":{"rendered":"<p>El resultado de dividir un n\u00famero n por un divisor d es un cociente q y un resto r.<\/p>\n<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   mayorResto :: Int -> Int -> (Int,[Int])\n<\/pre>\n<p>tal que (mayorResto n d) es el par (m,xs) tal que m es el mayor resto de dividir n entre x (con 1 \u2264 x &lt; d) y xs es la lista de n\u00fameros x menores que d tales que el resto de n entre x es m. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   mayorResto 20 10  ==  (6,[7])\n   mayorResto 50 8   ==  (2,[3,4,6])\n<\/pre>\n<p>Nota: Se supone que d es mayor que 1.<\/p>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nmayorResto :: Int -> Int -> (Int,[Int])\nmayorResto n d = (m, [x | x <- [1..d-1], n `rem` x == m])\n    where m = maximum [n `rem` x | x <- [1..d-1]]\n<\/pre>\n<h4>Referencia<\/h4>\n<p>El ejercio est\u00e1 basado en el problema <a href=\"http:\/\/bit.ly\/1jI31DE\">Largest possible remainder<\/a> publicado el 16 de octubre de 2015 en \"Programming paraxis\".<\/p>\n","protected":false},"excerpt":{"rendered":"<p>El resultado de dividir un n\u00famero n por un divisor d es un cociente q y un resto r. Definir la funci\u00f3n mayorResto :: Int -> Int -> (Int,[Int]) tal que (mayorResto n d) es el par (m,xs) tal que m es el mayor resto de dividir n entre x (con 1 \u2264 x &lt;&#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,15,31],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1629"}],"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=1629"}],"version-history":[{"count":5,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1629\/revisions"}],"predecessor-version":[{"id":1667,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1629\/revisions\/1667"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=1629"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=1629"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=1629"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}