{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"scicode","formal_name":"SciCode","introduction":"科学研究の問題をコードで解く能力を評価するベンチマークです。親問題を複数の小問題に分けており、今回のdev取得では15親問題と50小問題の関係を保持します。\n\nSciCode evaluates the ability to solve scientific research problems through code. Problems are decomposed into subproblems; this dev import preserves the relationships between 15 parent problems and 50 subproblems.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/SciCode1/SciCode","indexing_mode":"noindex"},"task_id":"0719795e-35cc-520c-9bf1-f1c551588e29","task_key":"dev--69e335f0-d1ca-5a82-bab6-b343e9761c03--10~2e8","task_revision_id":"2","upstream_id":"10.8","short_description":"Write a Python function to calculate this reciprocal-lattice sum, where the…","config":"","split":"dev","body":"{\"step_background\":\"\",\"step_description_prompt\":\"Write a Python function to calculate this reciprocal-lattice sum, where the weight W(k) is given in \\\\begin{align}\\nE_{\\\\textrm{recip}} &= \\\\sum_{\\\\mathbf{k} > 0} W(k) \\n\\\\left| \\n\\\\sum_{i=1}^N q_i \\\\mathrm{e}^{i \\\\mathbf{k} \\\\cdot \\\\mathbf{r}_i} \\\\sum_{j=1}^N q_j \\\\mathrm{e}^{-i \\\\mathbf{k} \\\\cdot \\\\mathbf{r}_j}\\n\\\\right|. \\\\\\\\\\n\\\\end{align}\"}","display_format":"scicode-step","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/SciCode1/SciCode","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}