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: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 280213238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 280477442,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 298585039,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 293654983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 279643556,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 281988618,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 282426536,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 282794977,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 280278411,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 282946648,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 286165981,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 278597861,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 279045012,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 282352034,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 280436576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 281962033,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 278615913,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 281644627,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 282984210,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Three Brothers\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three brothers agreed to meet. Let's number the brothers as follows: the oldest brother ... | TestCase-Eval | null | {
"problem_id": "2010B",
"submission_id": 280908813,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 269963418,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 269966491,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 269954402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270019664,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 275962311,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270103467,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 274149316,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270419822,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270033704,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270025200,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270011443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 294595594,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270345575,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 269913759,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 269956749,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 278928372,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 269992452,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270763320,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 269940952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Angry Monk\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.\n\n... | TestCase-Eval | null | {
"problem_id": "1992B",
"submission_id": 270042113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276278413,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276194840,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276363664,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276179554,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276225007,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276293889,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276199975,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 278552605,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276987783,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276974638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276205079,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 278398364,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276349053,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276268004,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276185223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276237912,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276297896,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276294353,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276227622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $... | TestCase-Eval | null | {
"problem_id": "2000D",
"submission_id": 276525335,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284620875,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284569233,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284571410,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284564236,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284582710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284658656,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284549693,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284718770,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 285128432,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284776698,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284555591,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284540996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284563486,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 291190787,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284541620,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284564707,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 290696085,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284546886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284551968,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how t... | TestCase-Eval | null | {
"problem_id": "2021A",
"submission_id": 284716144,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 293606382,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 289854373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 293855560,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 296364182,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 295548276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 296261074,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 269513302,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 269394129,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 295182770,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 295161327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 290491273,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 287621411,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 267838500,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 269015209,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 267747014,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 267768154,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 271061810,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 267796609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 269758600,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Distance to Different\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Consider an array $a$ of $n$ integers, where every element is from $1$ to $k$, an... | TestCase-Eval | null | {
"problem_id": "1989E",
"submission_id": 285392435,
"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.