Datasets:

Tommysha
/

zero-code-l1-lcb-v5-val

id stringlengths 4 8	question stringlengths 835 3.74k	question_title stringlengths 1 66	platform stringclasses 2 values	difficulty stringclasses 3 values	contest_date stringdate 2024-03-02 00:00:00 2024-07-27 00:00:00	starter_code stringlengths 0 124	public_test_cases stringlengths 2 536	private_test_cases stringlengths 124 92M	metadata stringlengths 2 49
3331	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: You are given a 0-indexed integer array nums, and an integer k. In one operation, you can remove one occurrence of the smallest element of nums. Return the mini...	minimum-operations-to-exceed-threshold-value-i	leetcode	easy	2024-03-02T00:00:00	class Solution: def minOperations(self, nums: List[int], k: int) -> int:	[{"input": "[2, 11, 10, 1, 3]\n10", "output": "3", "testtype": "functional"}, {"input": "[1, 1, 2, 4, 9]\n1", "output": "0", "testtype": "functional"}, {"input": "[1, 1, 2, 4, 9]\n9", "output": "4", "testtype": "functional"}]	eJztls1qFEEQxz148imGOS9SX10f4s2XEGIOIhECsglk9iAi+BD6vv5rsgQ3h7BZLyLbbDM1Pb2/qvpXTe/+ePnr3asX63j/FsbFt/l6e7tb5jfTfFF0+WEbPG+m+Wa37Fepb5eru2X5envVC59320/L9c3245f5+2b68/vCm8nxEWC0DjFyPCbB0MRUcJxP5phspqjNxAaOjEMOH89RQiwDeeEaDBbryRIFYhKwajSzWXkyS5HbgFYMrcr+jmXaDLAISdp+Zhcy6RCqzygk9MLMQJzIVxDraB/QoALo8agm9ozcOXUQN0qo1EfQGj2u...	{"func_name": "minOperations"}
3347	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: You are given a 1-indexed array of distinct integers nums of length n. You need to distribute all the elements of nums between two arrays arr1 and arr2 using n ...	distribute-elements-into-two-arrays-i	leetcode	easy	2024-03-02T00:00:00	class Solution: def resultArray(self, nums: List[int]) -> List[int]:	[{"input": "[2, 1, 3]", "output": "[2, 3, 1]", "testtype": "functional"}, {"input": "[5, 4, 3, 8]", "output": "[5, 3, 4, 8]", "testtype": "functional"}]	eJztVctKxEAQ9ODFvwg5B8m8Z/wSYdmDyAqCrILZg4jgR+j/efM3rJpucU1WyB5UEIXg0lNTqe7qdD8ePr8eHdS/0xf8WNy3l+ubzdCeNO3Ch67xfdeYZds17fVm2D4wPKsHw+p2GO5uVjy62KzPh8vr9dlV+9A1n8hwweGe9V1TJoRGDggoe5DagjsOSqjUjVl3nM7U2jUZ9xKeEqHMTvTuBMwjp6gMQRY1xH+bxuS7AfPIA+zyUMdC46fzY3ICgmC2ADPLQjV8otTUTH3UU6K2EPPoDRJOuBictF2Y0H+BmElP1XgMdbF7wTV5QZSz...	{"func_name": "resultArray"}
abc343_a	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: You are given two integers A and B, each between 0 and 9, inclusive. Print any integer between 0 and 9, inclusive, that is not equal to A + B. Input The input...	Wrong Answer	atcoder	easy	2024-03-02T00:00:00		[{"input": "2 5\n", "output": "2\n", "testtype": "stdin"}, {"input": "0 0\n", "output": "9\n", "testtype": "stdin"}, {"input": "7 1\n", "output": "4\n", "testtype": "stdin"}]	eJxrYJkqyMQABhFcQEZ0tVJmXkFpiZKVgpKhgkFMnpKOglJ+aQlUyAgiUJJaXFJSWZAKEiouScnMU6rVUUDSaYSp05hYnYboOk2I02moYIyu05RYOzF0mhGn00DBDF2nOXE6jRVM0HVaEGunBbpOS+J0mmLaaYBTZ+wUPQC4V567	{}
abc343_b	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: There is a simple undirected graph G with N vertices labeled with numbers 1, 2, \ldots, N. You are given the adjacency matrix (A_{i,j}) of G. That is, G has an ...	Adjacency Matrix	atcoder	easy	2024-03-02T00:00:00		[{"input": "4\n0 1 1 0\n1 0 0 1\n1 0 0 0\n0 1 0 0\n", "output": "2 3\n1 4\n1\n2\n", "testtype": "stdin"}, {"input": "2\n0 0\n0 0\n", "output": "\n\n", "testtype": "stdin"}, {"input": "5\n0 1 0 1 1\n1 0 0 1 0\n0 0 0 0 1\n1 1 0 0 1\n1 0 1 1 0\n", "output": "2 4 5\n1 4\n5\n1 2 5\n1 3 4\n", "testtype": "stdin"}]	eJzsvc2u7DqONdiD7vfYuOMcWP53P0kDncPKQU5uFZCnBoVCAT3u5+wH6W1LlEiuRdlx7t8+3wlE5rmxI2yZP4sUJTu4/p///f/6f/+//+N/+7//+5d//vof//ntl//z45dj+fuvw8cP/HqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P+XqL/xb/Lf4P...	{}
abc343_c	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: You are given a positive integer N. Find the maximum value of a palindromic cube number not greater than N. Here, a positive integer K is defined to be a palind...	343	atcoder	medium	2024-03-02T00:00:00		[{"input": "345\n", "output": "343\n", "testtype": "stdin"}, {"input": "6\n", "output": "1\n", "testtype": "stdin"}, {"input": "123456789012345\n", "output": "1334996994331\n", "testtype": "stdin"}]	eJxrYJlqzswABhEGQEZ0tVJmXkFpiZKVgpJhTJ6SjoJSfmkJqkBJanFJSWVBKkiouCQlM0+pVkcBSZ8Fuj4L4vQZk2mfobERuTaaYNgJFyJoq6GpJfmajY0xQxcuRki3qbGlkaUB+foNDQwMjKEY0xmYksT4xtjS0hiEcfkMU56QqUZGJmaWRqYGZuaGZqZGhpYmptQxF+RBNEC2wbFT9AAkvuu0	{}
abc343_d	"You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED)	Diversity of Scores	atcoder	medium	2024-03-02T00:00:00		"[{\"input\": \"3 4\\n1 10\\n3 20\\n2 10\\n2 10\\n\", \"output\": \"2\\n3\\n2\\n2\\n\", \"testtype\"(...TRUNCATED)	"eJzs3L2u5UianlFDupBC2mOQEWSQ0VciQG1qjHZKDUy1IYwE6Lbl6WMPBPT3nnHkCDJW44GmlMhcZx9u/kQEuff//I//6b//r/U(...TRUNCATED)	{}
abc343_e	"You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED)	7x7x7	atcoder	hard	2024-03-02T00:00:00		"[{\"input\": \"840 84 7\\n\", \"output\": \"Yes\\n0 0 0 0 6 0 6 0 0\\n\", \"testtype\": \"stdin\"},(...TRUNCATED)	"eJydk8FKAzEQhgv2QX5yrrKTzMxufAjPivXmHnrZFjY9SCn0IepLePMNTaIti4tr2PwhMwzMx/AnOS3fP28WeT1+xOT5YDbdbh/(...TRUNCATED)	{}
abc344_d	"You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED)	String Bags	atcoder	hard	2024-03-09T00:00:00		"[{\"input\": \"abcde\\n3\\n3 ab abc abcd\\n4 f c cd bcde\\n2 e de\\n\", \"output\": \"2\\n\", \"tes(...TRUNCATED)	"eJycvdsO9EbSJGYs/Ba+ScyNb3aBGR0+SX4SA9YNi+fzmSxyYcCP7sgiuzO6Rf07GAn61F83WYfMyMjIIln8//73//v//D/+2//(...TRUNCATED)	{}
abc344_a	"You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED)	Spoiler	atcoder	easy	2024-03-09T00:00:00		"[{\"input\": \"atcoder\|beginner\|contest\\n\", \"output\": \"atcodercontest\\n\", \"testtype\": \"st(...TRUNCATED)	"eJy9UkmOFDEQ5AD/aPV5xAN4CRJwSO92et/KNoXEI+AN3HgjBRwGdQvVaA7jk2VHZmRkxNfX33++efXnvP9xXD58vmofW72+u1x(...TRUNCATED)	{}
abc344_c	"You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED)	A+B+C	atcoder	medium	2024-03-09T00:00:00		"[{\"input\": \"3\\n1 2 3\\n2\\n2 4\\n6\\n1 2 4 8 16 32\\n4\\n1 5 10 50\\n\", \"output\": \"No\\nYes(...TRUNCATED)	"eJxk2k2Kre2WllEEG5KcFqx3/m9bkmB2wMrBgpas2EQ7IdgMv8yTzyjoKgQPbJh3EHBtImD8z//4z//r//zv//Cf/8ff/svf/+t(...TRUNCATED)	{}

End of preview. Expand in Data Studio

zero-code L1 validation set — LiveCodeBench v5, 2024-03-01 to 2024-08-01 (207 problems)

Validation set for the zero_code L1 task; the Test set is Tommysha/zero-code-l1-lcb-v5 (2024-08-01 to 2025-02-01, 279 problems).

Same source, schema, prompt and scorer as the Test set: livecodebench/code_generation_lite release_v5, filtered to contest_date in [2024-03-01, 2024-08-01). 207 problems: 74 easy / 75 medium / 58 hard; 110 AtCoder / 97 LeetCode.
These problems are also in agentica-org/DeepCoder-Preview-Dataset config lcbv5 split train; drop them from training (match on the problem statement) so validation stays unseen.
Scoring: the Test set's evaluator.py (LiveCodeBench testing_util, 6 s per test, all tests must pass) → pass@1.

Downloads last month: 15