{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"ds-1000","formal_name":"DS-1000","introduction":"DS-1000 builds 1,000 data-science problems from real StackOverflow questions across seven libraries including NumPy, Pandas and Matplotlib. The problems are perturbed so that recalling the original answer does not solve them.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://ds1000-code-gen.github.io/","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"d5c7aec9-b185-5b56-8205-a99df34b2fbd","task_key":"default--test--445","task_revision_id":"1","upstream_id":"445","short_description":"What I am trying to achieve is a 'highest to lowest' ranking of a list of…","config":"default","split":"test","body":"{\"library\":\"Numpy\",\"prompt\":\"Problem:\\nWhat I am trying to achieve is a 'highest to lowest' ranking of a list of values, basically the reverse of rankdata\\nSo instead of:\\na = [1,2,3,4,3,2,3,4]\\nrankdata(a).astype(int)\\narray([1, 2, 5, 7, 5, 2, 5, 7])\\nI want to get this:\\narray([7, 6, 3, 1, 3, 6, 3, 1])\\nI wasn't able to find anything in the rankdata documentation to do this.\\nA:\\n<code>\\nimport numpy as np\\nfrom scipy.stats import rankdata\\na = [1,2,3,4,3,2,3,4]\\n</code>\\nresult = ... # put solution in this variable\\nBEGIN SOLUTION\\n<code>\\n\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://ds1000-code-gen.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}