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: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 271858463,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267047311,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267056096,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267143174,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267053108,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267063249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267073768,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267034827,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267141205,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 269188321,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267814189,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267093572,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267064237,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 273777055,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 289832757,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267070889,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 268662844,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267050034,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267030187,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mathematical Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ of length $n > 1$, consisting of digits from $0$ to $9$... | TestCase-Eval | null | {
"problem_id": "1986D",
"submission_id": 267064266,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290893302,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290900022,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290923508,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290909722,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 299590395,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290920255,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 298482653,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290897952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290895909,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290911710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290899475,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290900566,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290926314,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290925443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290902605,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290927478,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290889524,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290888308,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290922797,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right... | TestCase-Eval | null | {
"problem_id": "2028A",
"submission_id": 290901518,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 294713065,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 302025434,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292844469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292470351,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 299591413,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292242320,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 300888149,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 300443651,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292165085,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292260033,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 294916645,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292187526,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 299046584,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292827619,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292523641,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292520151,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292212939,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 297987785,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 292301671,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DIY\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a list of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. You need to pick $$$8$$$ elem... | TestCase-Eval | null | {
"problem_id": "2038C",
"submission_id": 300512946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253102461,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 269595897,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253315000,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 281077284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 281083183,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 271316748,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253063635,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253085912,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253099000,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 285440934,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253094465,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253096725,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253067284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 282740994,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 253183735,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 254399546,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 305990410,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 284615727,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 261314066,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$... | TestCase-Eval | null | {
"problem_id": "1949C",
"submission_id": 260638287,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269553024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269255447,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269277834,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 294001709,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269323611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269284093,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269269156,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269273577,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269541577,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 292406255,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269267162,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269457830,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 298417100,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269290321,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269470205,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 269265030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 281080044,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 279408339,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 272639989,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to... | TestCase-Eval | null | {
"problem_id": "1983D",
"submission_id": 272638261,
"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.