benchmarks.wiki

benchmarks.wiki / Public workspace

BigCodeBench / BigCodeBench v0.1.0_hf 64939bc1-60ce-5bc3-80bf-0b15f0fa185b

Problem

Answer published by the source. Consult the official source to check your work against its answer.

complete prompt

import numpy as np
import random

def task_func(length=10000, seed=0):
    """
    Generates a random walk of a specified length. A random walk is a path that consists of a series of random steps
    on some mathematical space. In this case, the steps are either +1 or -1, chosen with equal probability.

    Parameters:
    - length (int): The number of steps in the random walk. Must be a non-negative integer. Default is 10000.
    - seed (int, optional): An optional seed value to initialize the random number generator. Use this for reproducible results.
    
    Requirements:
    - numpy
    - random
    
    Returns:
    - np.array: A numpy array representing the positions of the walk at each step. Starts at 0.

    Raises:
    - ValueError: If `length` is negative.
    
    Example:
    >>> random.seed(0)     # For reproducibility in doctest
    >>> walk = task_func(5)
    >>> walk.tolist()
    [0, 1, 2, 1, 0, 1]
    """

instruct prompt

Generates a random walk of a specified length. A random walk is a path that consists of a series of random steps on some mathematical space. In this case, the steps are either +1 or -1, chosen with equal probability.
The function should raise the exception for: ValueError: If `length` is negative.
The function should output with:
    np.array: A numpy array representing the positions of the walk at each step. Starts at 0.
You should write self-contained code starting with:

Code

import numpy as np
import random
def task_func(length=10000, seed=0):

code prompt

Code

import numpy as np
import random
def task_func(length=10000, seed=0):

entry point

task_func

libs

  • numpy
  • random

Discussion

Discussion

No discussion posts on this page yet. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

Source and history

task_id
64939bc1-60ce-5bc3-80bf-0b15f0fa185b
task_key
default--v0~2e1~2e0~5fhf--64939bc1-60ce-5bc3-80bf-0b15f0fa185b
task_revision_id
1
config / split
default / v0.1.0_hf

Official source

initial import