{"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":"ef309e68-4fbe-5870-83a4-2fce0d332dce","task_key":"default--test--776","task_revision_id":"1","upstream_id":"776","short_description":"Give the N and P, I want to get a 2D binomial distribution probability matrix M,","config":"default","split":"test","body":"{\"library\":\"Scipy\",\"prompt\":\"Problem:\\nGive the N and P, I want to get a 2D binomial distribution probability matrix M,\\nfor i in range(N+1):\\n   for j in range(i+1):\\n      M[i,j] = choose(i, j) * p**j * (1-p)**(i-j)\\nother value = 0\\n\\nI want to know is there any fast way to get this matrix, instead of the for loop. the N may be bigger than 100,000\\n\\nA:\\n<code>\\nimport numpy as np\\nimport scipy.stats\\nN = 3\\np = 0.5\\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":[]}