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: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258433751,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258438333,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258454125,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258478062,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 304481119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 306129801,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258540152,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 281852713,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258435607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258449539,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 266787788,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258452869,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 282968743,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258453662,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258436150,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 269125036,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258476966,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 288104521,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 258463442,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you ... | TestCase-Eval | null | {
"problem_id": "1966B",
"submission_id": 263876689,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266045540,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 269024672,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266023841,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 295152956,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 293597997,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 267114217,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266632242,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266587492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266165925,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 271712471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266023512,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 295254342,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266327329,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266329334,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 271096757,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266307144,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266176609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266123119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266078272,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Graph\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Given an array $a$ of length $n$. Let's construct a square matrix $b$ of size $n \\times n$... | TestCase-Eval | null | {
"problem_id": "1978F",
"submission_id": 266079947,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294043492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 296897046,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 305096125,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294090680,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294035191,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294080501,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 296945758,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294056970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 302553623,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294784508,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294108418,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294043152,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294034449,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294054752,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294021112,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 295929812,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294058733,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 297983367,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 294037416,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has... | TestCase-Eval | null | {
"problem_id": "2034B",
"submission_id": 304631138,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288557923,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288571419,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288533990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288895155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288539933,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288559489,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288550710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 291144265,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 297427003,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288552589,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288596776,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288537100,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288558137,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288929717,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288622096,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 291057463,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288543097,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288800087,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 294310879,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$... | TestCase-Eval | null | {
"problem_id": "2026B",
"submission_id": 288555395,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 286190857,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 254020138,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253797381,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253804292,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253843964,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253800074,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253801901,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 255584620,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253772346,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 297160476,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253748128,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253808399,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253779862,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 256431312,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 276502592,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 254035998,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 253762791,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 254358568,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 257353591,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all dig... | TestCase-Eval | null | {
"problem_id": "1950D",
"submission_id": 259648180,
"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.