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

rootsrc00049.py

00049.py11 linesDownload Raw Back to src

1def max_sum_of_three_consecutive(arr, n):2    sum = [0 for k in range(n)]3    if n >= 1:4        sum[0] = arr[0]5    if n >= 2:6        sum[1] = arr[0] + arr[1]7    if n > 2:8        sum[2] = max(sum[1], max(arr[1] + arr[2], arr[0] + arr[2]))9    for i in range(3, n):10        sum[i] = max(max(sum[i - 1], sum[i - 2] + arr[i]), arr[i] + arr[i - 1] + sum[i - 3])11    return sum[n - 1]