Datasetpublic

BlazingCustoms/pybytecode-mbpp-3.12

Data card — MBPP held-out decompilation benchmark 383 MBPP reference solutions compiled to Python 3.12 bytecode and paired with their source, with the original task_id restored on every row. Built 2026-08-04 by tools/build_mbpp_ood.py. Redistributable under CC-BY-4.0, provided NOTICES.md ships alongside. The set Rows 383 (400 candidates − 17 contaminated) Source google-research-datasets/mbpp, config full Licence CC-BY-4.0 task_id restored 383 /… See the full description on the dataset page: https://huggingface.co/datasets/BlazingCustoms/pybytecode-mbpp-3.12.

sourceHugging Facecc-by-4.0updated 2mo agoView on Hugging Face

0likes479downloads

rootsrc00273.py

00273.py12 linesDownload Raw Back to src

1def maximum_segments(n, a, b, c):2    dp = [-1] * (n + 10)3    dp[0] = 04    for i in range(0, n):5        if dp[i] != -1:6            if i + a <= n:7                dp[i + a] = max(dp[i] + 1, dp[i + a])8            if i + b <= n:9                dp[i + b] = max(dp[i] + 1, dp[i + b])10            if i + c <= n:11                dp[i + c] = max(dp[i] + 1, dp[i + c])12    return dp[n]