{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"scicode","formal_name":"SciCode","introduction":"SciCode 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":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"22b13939-7688-55b3-83b2-790444970c7d","task_key":"dev--69e335f0-d1ca-5a82-bab6-b343e9761c03--10~2e6","task_revision_id":"5","upstream_id":"10.6","short_description":"Write a Python function to generate all possible reciprocal-space points that…","config":"","split":"dev","body":"{\"step_background\":\"\",\"step_description_prompt\":\"Write a Python function to generate all possible reciprocal-space points that include [0 to gmax] in x direction and [-gmax, gmax] in y and z directions (inclusive), i.e. four quardrants, where gmax is the integer number of lattice points to include in one positive direction. Make sure to exclude the origin (0, 0, 0), all the points where x=0, y=0, z<0, and all the points where x=0, y<0. Inputs are reciprocal lattie vectors `recvec` and `gmax`.\"}","display_format":"scicode-step","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/SciCode1/SciCode","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}