Datasets:

Gen-Verse
/

LiveBench-ReasonFlux

dataset stringclasses 1 value	question stringlengths 449 3.95k	test_input listlengths 6 100	test_output listlengths 6 100	example_input listlengths 1 4	example_output listlengths 1 4	solutions null	task_id int64 0 127	test_time_limit int64 8 8	exe_method stringclasses 1 value
LiveBench	"You are given a 0-indexed integer array nums containing positive integers.\nYour task is to minimiz(...TRUNCATED)	["2 2\n","3 8\n","3 6 2\n","4 54 25 67 39\n","9 4 7 7 3 7 3\n","1 10 3 3 9 8 1\n","7 7 6 3 1 8 8 6\n(...TRUNCATED)	[ "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "6\n", "1\n", "1\n", "1\n", "50000\n" ]	[ "1 4 3 1\n", "5 5 5 10 5\n", "2 3 4\n" ]	[ "1\n", "2\n", "1\n" ]	null	0	8	stdin
LiveBench	"You are given an array nums consisting of positive integers.\nReturn the total frequencies of eleme(...TRUNCATED)	["6\n","1\n","2\n","7\n","22\n","7 4 9 8 8\n","1 4 7 7 2 7\n","2 4 3 3 3 5 9\n","3 10 8 9 2 4 9 6\n"(...TRUNCATED)	[ "1\n", "1\n", "1\n", "1\n", "1\n", "2\n", "3\n", "3\n", "2\n", "8\n", "100\n", "6\n" ]	[ "1 2 2 3 1 4\n", "1 2 3 4 5\n" ]	[ "4\n", "5\n" ]	null	1	8	stdin
LiveBench	"A non-negative integer n is called a good integer when it satisfies the following condition:\n\n- A(...TRUNCATED)	["1\n","613\n","5610\n","8612\n","147066183241\n","728962537208\n","674860790686\n","163331167957\n"(...TRUNCATED)	["0\n","8844\n","268828\n","466842\n","8804284840660860\n","86840806804284624\n","84048206660600440\(...TRUNCATED)	[ "8\n", "133\n", "31415926535\n" ]	[ "24\n", "2024\n", "2006628868244228\n" ]	null	2	8	stdin
LiveBench	"This is an interactive problem (a type of problem where your program interacts with the judge progr(...TRUNCATED)	["2 1\n","2 2\n","3 1\n","3 3\n","4 1\n","4 2\n","4 3\n","4 4\n","100 30\n","100 93\n","100 89\n","1(...TRUNCATED)	["1\n1 2 \n2\n","1\n1 2 \n1\n","2\n1 2 \n1 3 \n2\n","2\n1 2 \n1 3 \n1\n","2\n2 2 4 \n2 3 4 \n2\n","2(...TRUNCATED)	[ "3 1\n" ]	[ "2\n1 2 \n1 3 \n2\n" ]	null	3	8	stdin
LiveBench	"You are given an array of integers nums of length n.\nThe cost of an array is the value of its firs(...TRUNCATED)	["1 1 1\n","8 4 7\n","49 28 9\n","7 36 34\n","24 4 23\n","34 48 34\n","49 43 23\n","5 6 9 2 9\n","28(...TRUNCATED)	[ "3\n", "19\n", "86\n", "77\n", "51\n", "116\n", "115\n", "13\n", "32\n", "12\n", "11\n", "150\n" ]	[ "1 2 3 12\n", "5 4 3\n", "10 3 1 1\n" ]	[ "6\n", "12\n", "12\n" ]	null	4	8	stdin
LiveBench	"You are given an array of positive integers nums.\nYou need to select a subset of nums which satisf(...TRUNCATED)	["3 4\n","52 62\n","37 27\n","4 5 9\n","7 4 16\n","5 5 8 4\n","6 4 10 6\n","6 5 2 6 1\n","20220387 5(...TRUNCATED)	[ "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n", "1\n" ]	[ "5 4 1 2 2\n", "1 3 2 4\n" ]	[ "3\n", "1\n" ]	null	5	8	stdin
LiveBench	"There are N people standing in a line: person 1, person 2, \\ldots, person N.\nYou are given the ar(...TRUNCATED)	["1\n-1\n","2\n-1 1\n","2\n2 -1\n","3\n-1 1 2\n","3\n-1 3 1\n","3\n2 -1 1\n","3\n3 -1 2\n","300000\n(...TRUNCATED)	["1\n","1 2\n","2 1\n","1 2 3\n","1 3 2\n","2 1 3\n","2 3 1\n","1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 (...TRUNCATED)	["6\n4 1 -1 5 3 2\n","10\n-1 1 2 3 4 5 6 7 8 9\n","30\n3 25 20 6 18 12 26 1 29 -1 21 17 23 9 8 30 10(...TRUNCATED)	["3 5 4 1 2 6\n","1 2 3 4 5 6 7 8 9 10\n","10 17 12 6 4 21 11 24 26 7 30 16 25 2 28 27 20 3 1 8 15 1(...TRUNCATED)	null	6	8	stdin
LiveBench	"You are given a 0-indexed integer array batteryPercentages having length n, denoting the battery pe(...TRUNCATED)	["30 5 0 65 50 3 60 6 50 99\n","49 31 0 82 3 22 43 94 5 84\n","24 38 94 44 0 51 91 6 25 37\n","91 85(...TRUNCATED)	[ "8\n", "7\n", "8\n", "19\n", "21\n", "23\n", "28\n", "30\n", "61\n", "61\n", "62\n", "64\n" ]	[ "1 1 2 1 3\n", "0 1 2\n" ]	[ "3\n", "2\n" ]	null	7	8	stdin
LiveBench	"We define Extended A strings, Extended B strings, Extended C strings, and Extended ABC strings as f(...TRUNCATED)	["C\n","B\n","A\n","BC\n","AC\n","AB\n","ABA\n","ABC\n","AAACCCBBB\n","AAAAAAAAAAAAAAAAAAAAAAAAABBBB(...TRUNCATED)	[ "Yes\n", "Yes\n", "Yes\n", "Yes\n", "Yes\n", "Yes\n", "No\n", "Yes\n", "No\n", "Yes\n", "Yes\n", "Yes\n" ]	[ "AAABBBCCCCCCC\n", "ACABABCBC\n", "A\n", "ABBBBBBBBBBBBBCCCCCC\n" ]	[ "Yes\n", "No\n", "Yes\n", "Yes\n" ]	null	8	8	stdin
LiveBench	"You are given an integer sequence A=(A_1,A_2,\\ldots,A_N) of length N and integers L and R such tha(...TRUNCATED)	["107631 18 93\n80 1 53 67 20 25 88 92 7 24 56 98 49 25 53 77 81 53 73 54 91 21 27 54 18 13 31 1 34 (...TRUNCATED)	["80 18 53 67 20 25 88 92 18 24 56 93 49 25 53 77 81 53 73 54 91 21 27 54 18 18 31 18 34 93 93 18 63(...TRUNCATED)	[ "5 4 7\n3 1 4 9 7\n", "3 10 10\n11 10 9\n" ]	[ "4 4 4 7 7\n", "10 10 10\n" ]	null	9	8	stdin

End of preview. Expand in Data Studio

We use Stdio input/output format here. For example, for the task to calculate the sum of a list, the input and output are in the following format:

input = "5\n1 2 3 4 5\n"
output = "15"

CodeContests and CodeForces are using this format, however, MBPP and part of LiveCodeBench are using functional input/output format, such like

assert sum_function([1, 2, 3, 4, 5]) == 15

In this project, we have converted the the functional format to the Stdio format to achieve consistency.

Paper | Code

Citation

@article{wang2025cure,
  title={Co-Evolving LLM Coder and Unit Tester via Reinforcement Learning},
  author={Wang, Yinjie and Yang, Ling and Tian, Ye and Shen, Ke and Wang, Mengdi},
  journal={arXiv preprint arXiv:2506.03136},
  year={2025}
}

@article{white2024livebench,
  title={Livebench: A challenging, contamination-free llm benchmark},
  author={White, Colin and Dooley, Samuel and Roberts, Manley and Pal, Arka and Feuer, Ben and Jain, Siddhartha and Shwartz-Ziv, Ravid and Jain, Neel and Saifullah, Khalid and Naidu, Siddartha and others},
  journal={arXiv preprint arXiv:2406.19314},
  year={2024}
}