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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292119574,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 295934949,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 301122642,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292059000,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292870819,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292048175,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 299234976,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292033296,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292085699,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292064482,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292376085,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292060285,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292025971,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292090837,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292558550,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 300802029,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292262010,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292839295,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292350473,
"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: Ardent Flames\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have obtained the new limited event character Xilonen. You decide to use her in comba... | TestCase-Eval | null | {
"problem_id": "2037F",
"submission_id": 292557873,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 297949340,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 303918998,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 299108912,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 297946273,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 298956571,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 298066072,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 305047212,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 304980435,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 297871672,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 297946960,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 298407581,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 298099903,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 301515966,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 301306633,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 299094372,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 301206890,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 297860846,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 297943992,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 298059504,
"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: Snakes\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you play a game where the game field looks like a strip of $$$1 \\times 10^9$$$ square c... | TestCase-Eval | null | {
"problem_id": "2051G",
"submission_id": 297943280,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261904502,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 274184249,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261857259,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 266639656,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261910088,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261878114,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 262099707,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261857386,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261889372,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261911518,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261928647,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261839659,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261880779,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261862478,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 283111745,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261895156,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 261874624,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 263503996,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 262435978,
"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: Beautiful Triple Pairs\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Polycarp was given an array $a$ of $n$ integers. He really likes triples of numb... | TestCase-Eval | null | {
"problem_id": "1974C",
"submission_id": 262172692,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 289550923,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 289498921,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 298690353,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 289506962,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 299038145,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 299773129,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 292998589,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 291039656,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 289468776,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 289496663,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 291770954,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 289465571,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 292234733,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 291938577,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 290055800,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 290119895,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 289547284,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 291481103,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 291533031,
"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: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note ... | TestCase-Eval | null | {
"problem_id": "2036A",
"submission_id": 291140110,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258933140,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258925788,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258891614,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258914342,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258915061,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 261937345,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258913954,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258942922,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258909047,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258920321,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258921641,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 261089521,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258911688,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258921847,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258904455,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258921271,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 259632212,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 258913300,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 259817708,
"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: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B2",
"submission_id": 259006384,
"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.