{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"livecodebench","formal_name":"LiveCodeBench","introduction":"LiveCodeBench continuously collects new competitive-programming problems to evaluate coding capabilities. Its initial release_v1 contains 400 problems, with source platform, contest date, and dataset version tracked explicitly.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://livecodebench.github.io/","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"f0bc1bc3-6494-5c2e-92c7-80cfd2ccd398","task_key":"release~5fv1--test--2812","task_revision_id":"2","upstream_id":"2812","short_description":"find-the-maximum-achievable-number","config":"release_v1","split":"test","body":"{\"contest_date\":\"2023-07-09T00:00:00\",\"contest_id\":\"weekly-contest-353\",\"difficulty\":\"easy\",\"platform\":\"leetcode\",\"question_content\":\"You are given two integers, num and t.\\nAn integer x is called achievable if it can become equal to num after applying the following operation no more than t times:\\n\\nIncrease or decrease x by 1, and simultaneously increase or decrease num by 1.\\n\\nReturn the maximum possible achievable number. It can be proven that there exists at least one achievable number.\\n \\nExample 1:\\n\\nInput: num = 4, t = 1\\nOutput: 6\\nExplanation: The maximum achievable number is x = 6; it can become equal to num after performing this operation:\\n1- Decrease x by 1, and increase num by 1. Now, x = 5 and num = 5. \\nIt can be proven that there is no achievable number larger than 6.\\n\\n\\nExample 2:\\n\\nInput: num = 3, t = 2\\nOutput: 7\\nExplanation: The maximum achievable number is x = 7; after performing these operations, x will equal num: \\n1- Decrease x by 1, and increase num by 1. Now, x = 6 and num = 4.\\n2- Decrease x by 1, and increase num by 1. Now, x = 5 and num = 5.\\nIt can be proven that there is no achievable number larger than 7.\\n\\n \\nConstraints:\\n\\n1 <= num, t <= 50\",\"question_title\":\"find-the-maximum-achievable-number\",\"starter_code\":\"class Solution:\\n    def theMaximumAchievableX(self, num: int, t: int) -> int:\\n        \"}","display_format":"text","language":"","answer_status":"external_grader","assets":[],"source_url":"https://livecodebench.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}