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: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 287109420,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272138422,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272143161,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272244230,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272109100,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272140665,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272153079,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272326025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 274150139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 283897073,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 279008815,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272163705,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272123745,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272135493,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 274484627,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272245810,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272290381,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 296939637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272547114,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B1",
"submission_id": 272482040,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 296208141,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294437852,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294421643,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294426767,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 297030169,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294454721,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294417618,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294774474,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294407221,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 304543303,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 299257888,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294895608,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294413661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294437621,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294405965,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294474436,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294424007,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294454681,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294438097,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Colored Marbles\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob play a game. There are $$$n$$$ marbles, the $$$i$$$-th of them ... | TestCase-Eval | null | {
"problem_id": "2042B",
"submission_id": 294435495,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255816448,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255900727,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 300833162,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255750511,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 256009440,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255694560,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 257063048,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255761148,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 302627365,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255732980,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 256133704,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255746570,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 257067645,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 257212877,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 260773988,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 279470300,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255741600,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 261247479,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255743729,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consist... | TestCase-Eval | null | {
"problem_id": "1955E",
"submission_id": 255972610,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 260871435,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258956461,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 261037978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258917536,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258908514,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 270304025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 260962617,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258886072,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258893463,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 259997727,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 273255265,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258915402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258918395,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258914951,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 259073337,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 259534011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258890271,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258925778,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 258919710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $1$ and $n$ is written on each card: speci... | TestCase-Eval | null | {
"problem_id": "1972C",
"submission_id": 260147242,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 284604531,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 285749935,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 285601481,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 286418982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 286441698,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 286549383,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 284600857,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 284588564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 285793886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 285144538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 296468271,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 285452737,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 284612599,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 285276043,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 284604845,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 284588195,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 285004127,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 284596886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 284600397,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E2",
"submission_id": 292218930,
"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.