{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"humaneval-plus","formal_name":"HumanEval+","introduction":"HumanEval+ keeps the 164 original HumanEval problems and multiplies their tests by roughly 80×. It exists because the original suite was loose enough to pass implementations that were actually wrong.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/evalplus/evalplus","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"a944bd46-d9be-5973-a641-2333a7deb284","task_key":"default--test--a944bd46-d9be-5973-a641-2333a7deb284","task_revision_id":"2","upstream_id":"","short_description":"def get_max_triples(n):","config":"default","split":"test","body":"{\"entry_point\":\"get_max_triples\",\"prompt\":\"\\ndef get_max_triples(n):\\n    \\\"\\\"\\\"\\n    You are given a positive integer n. You have to create an integer array a of length n.\\n        For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1.\\n        Return the number of triples (a[i], a[j], a[k]) of a where i < j < k, \\n    and a[i] + a[j] + a[k] is a multiple of 3.\\n\\n    Example :\\n        Input: n = 5\\n        Output: 1\\n        Explanation: \\n        a = [1, 3, 7, 13, 21]\\n        The only valid triple is (1, 7, 13).\\n    \\\"\\\"\\\"\\n\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/evalplus/evalplus","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}