ReasonFLux-Coder
Collection
Coding LLMs excel at both writing code and generating unit tests.
•
9 items
•
Updated
•
9
Dataset Viewer
dataset
stringclasses 1
value | question
stringlengths 29
13k
| exe_method
stringclasses 1
value | solutions
null | task_id
int64 0
5.07k
| test_time_limit
int64 1
1
| example_input
sequencelengths 0
5
| example_output
sequencelengths 0
5
| test_input
sequencelengths 1
10
| test_output
sequencelengths 1
10
|
|---|---|---|---|---|---|---|---|---|---|
CodeContests
| "You are a cricket coach who wants to partition a set of players into two teams of equal size and a (...TRUNCATED) |
stdin
| null | 4,610 | 1 |
[
"4\n1\n3\n0\n1\n0\n-2\n\nSAMPLE\n"
] |
[
"3\n-1\n"
] | ["27523533\n961408417\n681942056\n48775101\n987795815\n0\n885584914\n508115100\n167083974\n373839485(...TRUNCATED) | ["681942056\n-1\n518828014\n-1\n540350002\n528362143\n528362143\n528362143\n-1\n-1\n-1\n528823323\n5(...TRUNCATED) |
CodeContests
| "Pravin and Saddam are room-mates.They always solve aptitude questions together. Once, they came acr(...TRUNCATED) |
stdin
| null | 4,888 | 1 |
[
"2\n1 2\n3 5\n\nSAMPLE\n"
] |
[
"3\n0\n"
] | ["12\n3 9\n4 8\n2 18\n6 13\n9 14\n8 16\n10 11\n11 5\n16 17\n16 18\n17 17\n18 18\n","2\n2 2\n3 5\n\nS(...TRUNCATED) | ["0\n4\n2\n0\n0\n0\n0\n0\n0\n0\n0\n0\n","2\n0\n","0\n4\n4\n0\n0\n0\n0\n0\n0\n0\n0\n0\n","4\n0\n","2\(...TRUNCATED) |
CodeContests
| "Brave Ponta and his best friend, Brave Gonta, have come to Luida's bar in search of friends to emba(...TRUNCATED) |
stdin
| null | 1,495 | 1 |
[
"5\n1 2 3 4 5\n4\n2 3 5 7\n0\n"
] |
[
"1\n1\n"
] | ["5\n1 2 3 4 5\n4\n2 3 5 10\n0\n","5\n1 2 3 4 5\n4\n1 3 5 10\n0\n","5\n1 2 3 4 5\n4\n1 3 4 10\n0\n",(...TRUNCATED) |
[
"1\n0\n",
"1\n1\n",
"1\n2\n",
"0\n1\n",
"0\n2\n",
"0\n0\n",
"1\n3\n",
"8\n2\n",
"1\n4\n",
"10\n2\n"
] |
CodeContests
| "The penultimate task involved the calculation of the typical Fibonacci sequence up to the nth term.(...TRUNCATED) |
stdin
| null | 3,386 | 1 |
[
"5\n\nSAMPLE\n"
] |
[
"1\n1\n2\n3\n5\n"
] | ["5\n\nMASPLE\n","5\n\nELPSAM\n","5\n\nELPSBM\n","5\n\nELPSBL\n","5\n\nLEPSBL\n","5\n\nMEPSBL\n","5\(...TRUNCATED) | ["1\n1\n2\n3\n5\n","1\n1\n2\n3\n5\n","1\n1\n2\n3\n5\n","1\n1\n2\n3\n5\n","1\n1\n2\n3\n5\n","1\n1\n2\(...TRUNCATED) |
CodeContests
| "Today grasshopper Jimmy Jumper is very hungry and his friend is notorious. Jimmy's friend puts an i(...TRUNCATED) |
stdin
| null | 4,061 | 1 |
[
"3\n3\n15\n5\n\nSAMPLE\n"
] |
[
"YES\nYES\nNO\n"
] | ["3\n3\n15\n5\n\nASMPLE\n","3\n3\n30\n2\n\nASLPLE\n","3\n1\n19\n1\n\nASLPLE\n","3\n2\n19\n1\n\nASLPL(...TRUNCATED) | ["YES\nYES\nNO\n","YES\nNO\nNO\n","YES\nNO\nYES\n","NO\nNO\nYES\n","NO\nNO\nNO\n","NO\nYES\nNO\n","N(...TRUNCATED) |
CodeContests
| "There is a directed graph with N vertices and N edges. The vertices are numbered 1, 2, ..., N.\n\nT(...TRUNCATED) |
stdin
| null | 1,811 | 1 |
[
"6\n4 5 6 5 6 4\n",
"4\n2 3 1 1\n",
"3\n2 3 1\n",
"4\n2 3 4 1\n"
] |
[
"IMPOSSIBLE\n",
"POSSIBLE\n",
"IMPOSSIBLE\n",
"POSSIBLE\n"
] | ["4\n2 3 2 1\n","6\n4 5 6 5 5 4\n","6\n4 5 6 1 6 4\n","4\n2 1 2 1\n","6\n4 4 6 1 6 4\n","4\n2 1 4 1\(...TRUNCATED) | ["POSSIBLE\n","IMPOSSIBLE\n","POSSIBLE\n","POSSIBLE\n","POSSIBLE\n","POSSIBLE\n","POSSIBLE\n","POSSI(...TRUNCATED) |
CodeContests
| "Chef has an array of N integers. He wants to play a special game. In this game he needs to make all(...TRUNCATED) |
stdin
| null | 3,219 | 1 |
[
"3\n-1 -2 -3\n2\n"
] |
[
"5\n"
] | ["3\n-2 -2 -3\n2\n","3\n-2 -2 -1\n2\n","3\n-2 0 -1\n4\n","3\n0 1 -2\n4\n","3\n1 0 -1\n3\n","3\n2 3 0(...TRUNCATED) |
[
"5\n",
"4\n",
"3\n",
"2\n",
"1\n",
"0\n",
"6\n",
"7\n",
"9\n",
"8\n"
] |
CodeContests
| "Gajodhar is travelling from one city to another city. Let starting city be the source and city at w(...TRUNCATED) |
stdin
| null | 4,652 | 1 |
[
"2\n3\nCHANDIGARH\nMUMBAI\nCHENNAI\n4\nKASHMIR\nDELHI\nBANGLORE\nKANYAKUMARI\n\nSAMPLE\n"
] |
[
"1\n2\n"
] | ["2\n3\nCHANDIGARH\nIABMUM\nCHENNAI\n4\nKASHMIR\nDELHI\nBANGLORE\nKANYAKUMARI\n\nSAMPLE\n","2\n3\nCH(...TRUNCATED) |
[
"1\n2\n",
"1\n2\n",
"1\n2\n",
"1\n2\n",
"1\n2\n",
"1\n2\n",
"1\n2\n",
"1\n2\n",
"1\n2\n",
"1\n2\n"
] |
CodeContests
| "For a given sequence of integers $A = \\\\{a_0, a_1, ..., a_{n-1}\\\\}$, perform the following oper(...TRUNCATED) |
stdin
| null | 1,267 | 1 |
[
"9\n1 4 1 4 2 1 3 5 6\n3\n0 9 1\n1 6 1\n3 7 5\n"
] |
[
"3\n2\n0\n"
] | ["9\n1 4 1 4 2 0 3 5 6\n3\n0 9 1\n1 6 1\n3 7 5\n","9\n1 4 1 4 4 -1 3 5 6\n3\n0 9 1\n0 6 1\n3 7 5\n",(...TRUNCATED) | ["2\n1\n0\n","2\n2\n0\n","2\n0\n0\n","1\n0\n0\n","0\n1\n0\n","3\n2\n0\n","1\n2\n0\n","1\n1\n0\n","0\(...TRUNCATED) |
CodeContests
| "Given is an integer S. Find a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfi(...TRUNCATED) |
stdin
| null | 2,957 | 1 |
[
"100\n",
"311114770564041497\n",
"3\n"
] |
[
"0 0 10 0 0 10\n",
"314159265 358979323 846264338 327950288 419716939 937510582\n",
"1 0 2 2 0 1\n"
] | ["80182456107003087\n","5\n","158461871566595116\n","10\n","186455597317386972\n","20\n","1816783309(...TRUNCATED) | ["0 0 1000000000 1 892996913 80182457\n","0 0 1000000000 1 999999995 1\n","0 0 1000000000 1 43340488(...TRUNCATED) |
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.
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{li2022alphacode,
author = {Yujia Li and David Choi and Junyoung Chung and Nate Kushman and Julian Schrittwieser and Rémi Leblond and Tom Eccles and James Keeling and Felix Gimeno and Agustin Dal Lago and Thomas Hubert and Peter Choy and Cyprien de Masson d’Autume and Igor Babuschkin and Xinyun Chen and Po-Sen Huang and Johannes Welbl and Sven Gowal and Alexey Cherepanov and James Molloy and Daniel J. Mankowitz and Esme Sutherland Robson and Pushmeet Kohli and Nando de Freitas and Koray Kavukcuoglu and Oriol Vinyals},
title = {Competition-level code generation with AlphaCode},
journal = {Science},
volume = {378},
number = {6624},
pages = {1092--1097},
year = {2022},
doi = {10.1126/science.abq1158},
url = {https://www.science.org/doi/10.1126/science.abq1158}
}
- Downloads last month
- 154
Size of downloaded dataset files:
73.5 MB
Size of the auto-converted Parquet files:
35.5 MB
Number of rows:
4,529