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: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 276725924,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270976113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270040006,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270034436,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270277397,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270012574,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270078917,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 276735813,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270034704,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270114437,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270503664,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 272204219,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270020524,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270001743,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 272511972,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 283596330,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270453196,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270055656,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270022593,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$... | TestCase-Eval | null | {
"problem_id": "1992E",
"submission_id": 270039668,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 300393575,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285732607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 286211627,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 286226467,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 286224334,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 286220960,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285715661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285713779,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 286308161,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285723333,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285739377,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285720831,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285739034,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 287648222,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 290300042,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285806443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285727829,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285716183,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285712859,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed t... | TestCase-Eval | null | {
"problem_id": "2022E1",
"submission_id": 285731863,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264439634,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264534114,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264466064,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264455610,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264472698,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264443457,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 273071539,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 265865037,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264600894,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 271161133,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264455471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 277070679,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 265799738,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 265093021,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264439968,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264417240,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264531145,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264488267,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264446865,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite seque... | TestCase-Eval | null | {
"problem_id": "1979B",
"submission_id": 264463809,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 297701492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 293044476,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 293054558,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 293109331,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 295540223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 295198955,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 293625228,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 294174589,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 305980722,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 298750690,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 297089091,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 294111608,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 300972188,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 295929656,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 294184008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 294771402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 293135343,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 296138816,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 293530363,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bowling Frame\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Bowling is a national sport in Taiwan; everyone in the country plays the sport on a dail... | TestCase-Eval | null | {
"problem_id": "2041B",
"submission_id": 294202054,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 304469180,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 293577277,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 304214203,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 302763510,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 304708513,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 305123345,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 304988796,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 306943252,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 293352828,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 293071392,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 293616005,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 294873533,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 293581165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 298355769,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 300032943,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 293131905,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 299285262,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 293075869,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 298357308,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Selection Sort\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Every student enrolled in the algorithms course is required to submit an assignment thi... | TestCase-Eval | null | {
"problem_id": "2041M",
"submission_id": 293355030,
"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.