{"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":"db0631d1-0520-5e5e-9f1f-f8d699d03223","task_key":"release~5fv1--test--2811","task_revision_id":"2","upstream_id":"2811","short_description":"determine-the-minimum-sum-of-a-k-avoiding-array","config":"release_v1","split":"test","body":"{\"contest_date\":\"2023-08-20T00:00:00\",\"contest_id\":\"weekly-contest-359\",\"difficulty\":\"medium\",\"platform\":\"leetcode\",\"question_content\":\"You are given two integers, n and k.\\nAn array of distinct positive integers is called a k-avoiding array if there does not exist any pair of distinct elements that sum to k.\\nReturn the minimum possible sum of a k-avoiding array of length n.\\n \\nExample 1:\\n\\nInput: n = 5, k = 4\\nOutput: 18\\nExplanation: Consider the k-avoiding array [1,2,4,5,6], which has a sum of 18.\\nIt can be proven that there is no k-avoiding array with a sum less than 18.\\n\\nExample 2:\\n\\nInput: n = 2, k = 6\\nOutput: 3\\nExplanation: We can construct the array [1,2], which has a sum of 3.\\nIt can be proven that there is no k-avoiding array with a sum less than 3.\\n\\n \\nConstraints:\\n\\n1 <= n, k <= 50\",\"question_title\":\"determine-the-minimum-sum-of-a-k-avoiding-array\",\"starter_code\":\"class Solution:\\n    def minimumSum(self, n: int, k: 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":[]}