|
Download benchmarks/Data_structures/stack/problem.md from PV-SJTU/PV-Bench: direct link, hf CLI and curl.
- Browser
- Download file 635 Bytes
-
https://huggingface.co/datasets/PV-SJTU/PV-Bench/resolve/main/benchmarks/Data_structures/stack/problem.md
- Command line
-
hf download hf://datasets/PV-SJTU/PV-Bench/benchmarks/Data_structures/stack/problem.md
-
curl -L -o problem.md https://huggingface.co/datasets/PV-SJTU/PV-Bench/resolve/main/benchmarks/Data_structures/stack/problem.md
635 Bytes
Array-Based Stack
Problem Description
Maintain a bounded integer stack and support push, pop, and bulk construction operations.
Input
The functions receive the array representation, its logical size or capacity, and the operation-specific values described by their C signatures.
Output
Each operation returns or updates the represented data structure according to its interface contract.
Constraints
All indices, sizes, capacities, and stored values satisfy the bounds stated by the corresponding function contract.
Source
Classical data-structure implementation reconstructed from the verified C artifact.