data_source stringclasses 1
value | prompt listlengths 1 1 | ability stringclasses 1
value | reward_model null | extra_info dict |
|---|---|---|---|---|
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273530982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 293164368,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273553035,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273531025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273529155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273685171,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273527200,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273546735,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273592508,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 274281525,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273599450,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273558556,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273520380,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273584960,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273519232,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273612238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273520007,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273550022,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273530422,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is ei... | TestCase-Eval | null | {
"problem_id": "1997B",
"submission_id": 273547049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288369490,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288405912,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288436820,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288354796,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288371181,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288357970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 289992014,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288334497,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288379127,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 295467540,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 290808037,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288428424,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288377191,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 293648855,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 299188744,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288874365,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288348417,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288337993,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 290641030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n... | TestCase-Eval | null | {
"problem_id": "2035F",
"submission_id": 288356571,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 306969376,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 297023685,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 297702047,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 297384390,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 301082299,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 295343338,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 294909718,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 298673425,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 295832685,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 299075189,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 300563352,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 295173633,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 294906901,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 299801721,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 300799915,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 303194401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 298520456,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 295791158,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 299382521,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Columns and Find a Path\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There is a matrix consisting of $$$2$$$ rows and $$$n$$$ columns. The rows... | TestCase-Eval | null | {
"problem_id": "2046A",
"submission_id": 294539111,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283539483,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283718280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283302816,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 300415206,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 300415162,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 300415078,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283465727,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283233568,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283292346,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 284105785,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 285954024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 285658024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283535769,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 286654656,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 285637904,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 285637632,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283303511,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 283923208,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 286696328,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n... | TestCase-Eval | null | {
"problem_id": "2018E2",
"submission_id": 285952118,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287997404,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287851406,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287721870,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 288269355,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 296497003,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287734610,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287757738,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 295419415,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287737707,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287716081,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287786098,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287848374,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287818762,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287728205,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287717128,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 299453863,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287693158,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287711399,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 288451486,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be repre... | TestCase-Eval | null | {
"problem_id": "2033B",
"submission_id": 287721530,
"task_type": "TestCase-Eval-Task2"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.