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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 262090380,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255306140,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255318768,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255324848,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255290229,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255326184,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255287697,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255285839,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 256940451,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255256755,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255290007,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255306228,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255322578,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 269413702,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255262446,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255284549,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 256057957,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 256366156,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255278584,
"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: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned of... | TestCase-Eval | null | {
"problem_id": "1951A",
"submission_id": 255311140,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282164494,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282051529,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282164722,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 287097833,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282101710,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282079737,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282044246,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282117539,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 287105141,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 284460276,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282153150,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282071458,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282053207,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282030304,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282034553,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282080775,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282056033,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282088626,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 286804078,
"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: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rat... | TestCase-Eval | null | {
"problem_id": "2013B",
"submission_id": 282043950,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 259707309,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 259622196,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 258892388,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 262789073,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 258895851,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 262815170,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 258889483,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 259501648,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 258885703,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 258893327,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 295504490,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 258991340,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 259362840,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 259132556,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 261009348,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 261176726,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 264405666,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 292979745,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 258912598,
"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: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or faci... | TestCase-Eval | null | {
"problem_id": "1972B",
"submission_id": 258900954,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275794143,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 277627960,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275815289,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 276766708,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275852712,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275806553,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275861486,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275845935,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275829055,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 284710495,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 292250168,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 281112914,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275847092,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275866202,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 276305197,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275854040,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275976308,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275901896,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 276166426,
"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: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a ge... | TestCase-Eval | null | {
"problem_id": "2002D2",
"submission_id": 275858765,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288592751,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288643780,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 289422882,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288517416,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288603100,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288630761,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288569757,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288605426,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288599701,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288688236,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 295763139,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 295159432,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288548017,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288599582,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288647932,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288611354,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288594821,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288567967,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288603400,
"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: Best Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given an integer array $a$ of size $n$.\n\nLet's define the value of the array as its ... | TestCase-Eval | null | {
"problem_id": "2026E",
"submission_id": 288603809,
"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.