{"id":7326,"date":"2022-09-08T06:00:34","date_gmt":"2022-09-08T04:00:34","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7326"},"modified":"2022-12-14T16:29:58","modified_gmt":"2022-12-14T14:29:58","slug":"mayor-numero-con-dos-digitos-dados","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/mayor-numero-con-dos-digitos-dados\/","title":{"rendered":"Mayor n\u00famero con dos d\u00edgitos dados"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   numeroMayor :: Int -> Int -> Int\n<\/pre>\n<p>tal que <code>(numeroMayor x y)<\/code> es el mayor n\u00famero de dos cifras que puede construirse con los d\u00edgitos <code>x<\/code> e <code>y<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   numeroMayor 2 5 ==  52\n   numeroMayor 5 2 ==  52\n<\/pre>\n<p><b>Soluciones<\/b><\/p>\n<p>A continuaci\u00f3n se muestran las <a href=\"#haskell\">soluciones en Haskell<\/a> y las <a href=\"#python\">soluciones en Python<\/a>.<\/p>\n<p><a name=\"haskell\"><\/a><br \/>\n<b>Soluciones en Haskell<\/b><\/p>\n<pre lang=\"haskell\">\n-- 1\u00aa definici\u00f3n:\nnumeroMayor1 :: Int -> Int -> Int\nnumeroMayor1 x y = 10 * max x y + min x y\n\n-- 2\u00aa definici\u00f3n:\nnumeroMayor2 :: Int -> Int -> Int\nnumeroMayor2 x y | x > y     = 10*x+y\n                 | otherwise = 10*y+x\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_numeroMayor :: Bool\nprop_numeroMayor =\n  and [numeroMayor1 x y == numeroMayor2 x y | x <- [0..9], y <- [0..9]]\n\n-- La comprobaci\u00f3n es\n--    \u03bb> prop_numeroMayor\n--    True\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium\/blob\/main\/src\/Mayor_numero_con_dos_digitos_dados.hs\">GitHub<\/a>.<\/p>\n<p><a name=\"python\"><\/a><br \/>\n<b>Soluciones en Python<\/b><\/p>\n<pre lang=\"python\">\n# 1\u00aa definici\u00f3n\ndef numeroMayor1(x: int, y: int) -> int:\n    return 10 * max(x, y) + min(x, y)\n\n# 2\u00aa definici\u00f3n\ndef numeroMayor2(x: int, y: int) -> int:\n    if x > y:\n        return 10 * x + y\n    return 10 * y + x\n\n# La propiedad de equivalencia de las definiciones es\ndef test_equiv_numeroMayor():\n    # type: () -> bool\n    return all(numeroMayor1(x, y) == numeroMayor2(x, y)\n               for x in range(10) for y in range(10))\n\n# La comprobaci\u00f3n es\n#    >>> test_equiv_numeroMayor()\n#    True\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium-Python\/blob\/main\/src\/mayor_numero_con_dos_digitos_dados.py\">GitHub<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n numeroMayor :: Int -> Int -> Int tal que (numeroMayor x y) es el mayor n\u00famero de dos cifras que puede construirse con los d\u00edgitos x e y. Por ejemplo, numeroMayor 2 5 == 52 numeroMayor 5 2 == 52 Soluciones A continuaci\u00f3n se muestran las soluciones en Haskell y las soluciones&#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":[581],"tags":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7326"}],"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=7326"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7326\/revisions"}],"predecessor-version":[{"id":7696,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7326\/revisions\/7696"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7326"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7326"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7326"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}