{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"livecodebench","formal_name":"LiveCodeBench","introduction":"競技プログラミングの新しい問題を継続的に収集し、コードに関する能力を評価するベンチマークです。初期release_v1は400問で、問題の出題元と公開日時、データセットの版を区別して扱います。\n\nLiveCodeBench 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"},"task_id":"483a9bd6-646d-5993-a80f-141b63a6db8e","task_key":"release~5fv1--test--2848","task_revision_id":"1","upstream_id":"2848","short_description":"special-permutations","config":"release_v1","split":"test","body":"{\"contest_date\":\"2023-06-18T00:00:00\",\"contest_id\":\"weekly-contest-350\",\"difficulty\":\"medium\",\"platform\":\"leetcode\",\"question_content\":\"You are given a 0-indexed integer array nums containing n distinct positive integers. A permutation of nums is called special if:\\n\\nFor all indexes 0 <= i < n - 1, either nums[i] % nums[i+1] == 0 or nums[i+1] % nums[i] == 0.\\n\\nReturn the total number of special permutations. As the answer could be large, return it modulo 10^9 + 7.\\n \\nExample 1:\\n\\nInput: nums = [2,3,6]\\nOutput: 2\\nExplanation: [3,6,2] and [2,6,3] are the two special permutations of nums.\\n\\nExample 2:\\n\\nInput: nums = [1,4,3]\\nOutput: 2\\nExplanation: [3,1,4] and [4,1,3] are the two special permutations of nums.\\n\\n \\nConstraints:\\n\\n2 <= nums.length <= 14\\n1 <= nums[i] <= 10^9\",\"question_title\":\"special-permutations\",\"starter_code\":\"class Solution:\\n    def specialPerm(self, nums: List[int]) -> int:\\n        \"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://livecodebench.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}