{"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":"b23d86c4-a5b4-5981-af4d-30d268d3badd","task_key":"release~5fv1--test--2873","task_revision_id":"2","upstream_id":"2873","short_description":"prime-pairs-with-target-sum","config":"release_v1","split":"test","body":"{\"contest_date\":\"2023-07-02T00:00:00\",\"contest_id\":\"weekly-contest-352\",\"difficulty\":\"medium\",\"platform\":\"leetcode\",\"question_content\":\"You are given an integer n. We say that two integers x and y form a prime number pair if:\\n\\n1 <= x <= y <= n\\nx + y == n\\nx and y are prime numbers\\n\\nReturn the 2D sorted list of prime number pairs [x_i, y_i]. The list should be sorted in increasing order of x_i. If there are no prime number pairs at all, return an empty array.\\nNote: A prime number is a natural number greater than 1 with only two factors, itself and 1.\\n \\nExample 1:\\n\\nInput: n = 10\\nOutput: [[3,7],[5,5]]\\nExplanation: In this example, there are two prime pairs that satisfy the criteria. \\nThese pairs are [3,7] and [5,5], and we return them in the sorted order as described in the problem statement.\\n\\nExample 2:\\n\\nInput: n = 2\\nOutput: []\\nExplanation: We can show that there is no prime number pair that gives a sum of 2, so we return an empty array. \\n\\n \\nConstraints:\\n\\n1 <= n <= 10^6\",\"question_title\":\"prime-pairs-with-target-sum\",\"starter_code\":\"class Solution:\\n    def findPrimePairs(self, n: int) -> List[List[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":[]}