{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"hlce","formal_name":"Humanity's Last Code Exam","introduction":"Humanity's Last Code Exam evaluates problem solving and code generation using ICPC World Finals and IOI problems. The project describes 235 problems; this import selects its public ICPC dataset of 146 problems.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://humanity-s-last-code-exam.github.io/website/","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"adb62fe9-9790-53d1-a7a8-17a530a260cd","task_key":"ICPC~2dWorld~2dFinals--examples--2016~5fE","task_revision_id":"3","upstream_id":"2016_E","short_description":"Forever Young","config":"ICPC-World-Finals","split":"examples","body":"{\"platform\":\"atcoder\",\"question_content\":\"## Problem Description\\n\\nMy birthday is coming up. Alas, I am getting old and would like to feel young again. Fortunately, I have come up with an excellent way of feeling younger: if I write my age as a number in an appropriately chosen base \\\\( b \\\\), then it appears to be smaller. For instance, suppose my age in base 10 is 32. Written in base 16 it is only 20!\\n\\nHowever, I cannot choose an arbitrary base when doing this. If my age written in base \\\\( b \\\\) contains digits other than 0 to 9, then it will be obvious that I am cheating, which defeats the purpose. In addition, if my age written in base \\\\( b \\\\) is too small then it would again be obvious that I am cheating.\\n\\nGiven my age \\\\( y \\\\) and a lower bound \\\\( \\\\ell \\\\) on how small I want my age to appear, find the largest base \\\\( b \\\\) such that \\\\( y \\\\) written in base \\\\( b \\\\) contains only decimal digits, and is at least \\\\( \\\\ell \\\\) when interpreted as a number in base 10.\\n\\n### Input\\n\\nThe input consists of a single line containing two base 10 integers \\\\( y \\\\) (10 ≤ \\\\( y \\\\) ≤ \\\\( 10^{18} \\\\) – yes, I am very old) and \\\\( \\\\ell \\\\) (10 ≤ \\\\( \\\\ell \\\\) ≤ \\\\( y \\\\)).\\n\\n### Output\\n\\nDisplay the largest base \\\\( b \\\\) as described above.\\n\\n### Sample Input 1\\n\\n```\\n32 20\\n```\\n\\n### Sample Output 1\\n\\n```\\n16\\n```\\n\\n### Sample Input 2\\n\\n```\\n2016 100\\n```\\n\\n### Sample Output 2\\n\\n```\\n42\\n```\",\"question_title\":\"Forever Young\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://humanity-s-last-code-exam.github.io/website/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}