|
Download benchmarks/Algorithms/integer_divide/problem.md from PV-SJTU/PV-Bench: direct link, hf CLI and curl.
- Browser
- Download file 421 Bytes
-
https://huggingface.co/datasets/PV-SJTU/PV-Bench/resolve/main/benchmarks/Algorithms/integer_divide/problem.md
- Command line
-
hf download hf://datasets/PV-SJTU/PV-Bench/benchmarks/Algorithms/integer_divide/problem.md
-
curl -L -o problem.md https://huggingface.co/datasets/PV-SJTU/PV-Bench/resolve/main/benchmarks/Algorithms/integer_divide/problem.md
421 Bytes
Prime Factorization
Description
Factor a positive integer into prime factors, preserving multiplicity.
Input
The function receives an integer $n$ and a writable output array.
Output
Write the prime factors of $n$ to the output array in nondecreasing order.
Constraints
- $1 \le n \le \texttt{INT_MAX}$.
Source
Classical integer-factorization problem reconstructed from the verified C artifact.