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: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282022659,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282050460,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282006786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282081623,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282462284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282086061,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282071919,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282027070,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282024865,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282056234,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282014760,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282065345,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282019725,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282057672,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282025165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 297974805,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282039294,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282641771,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282058158,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan de... | TestCase-Eval | null | {
"problem_id": "2013A",
"submission_id": 282041815,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285708137,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285738076,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 291576555,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285712409,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285707207,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285761529,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285733584,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285715676,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285730079,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 291107670,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285724886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285732062,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285716344,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 288202549,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285794231,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285733040,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285822017,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285738822,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285773806,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. ... | TestCase-Eval | null | {
"problem_id": "2022B",
"submission_id": 285992932,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 271514434,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 277437127,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 270581376,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 270380662,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 269941746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 270029156,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 272698733,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 271035990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 271190013,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 271418605,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 271513424,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 270197339,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 270348906,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 270159609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 271437254,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 287219039,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 272500145,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 270054464,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 289385346,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept ... | TestCase-Eval | null | {
"problem_id": "1992G",
"submission_id": 270589246,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 297773899,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287811228,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287972345,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287873004,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287819593,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287859212,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287842791,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287833481,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287843768,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 293140681,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 289005021,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 294875443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 291174213,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 289172549,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287769476,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287745349,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287974322,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 287790508,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 288873996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Kosuke's Sloth\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kosuke is too lazy. He will not give you any legend, just the task:\n\nFibonacci numbers... | TestCase-Eval | null | {
"problem_id": "2033F",
"submission_id": 288446080,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259463554,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 261004789,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259846066,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259682969,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259466077,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259465942,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 300105226,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 273049714,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259200600,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 260962017,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 262411599,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 260079827,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259831131,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259198244,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 262959368,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 259744730,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 267628791,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 260602541,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 306778448,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide th... | TestCase-Eval | null | {
"problem_id": "1968F",
"submission_id": 265653464,
"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.