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.
0479
1def longest_subseq_with_diff_one(arr, n):2 dp = [1 for i in range(n)]3 for i in range(n):4 for j in range(i):5 if arr[i] == arr[j] + 1 or arr[i] == arr[j] - 1:6 dp[i] = max(dp[i], dp[j] + 1)7 result = 18 for i in range(n):9 if result < dp[i]:10 result = dp[i]11 return result