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: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 295910532,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294851501,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 296979614,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294580522,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294634937,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 296560875,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294544196,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294577021,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294544793,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 306132189,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294549227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294577539,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294578380,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 304279544,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 295703790,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 296252003,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 295110279,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294543035,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294562706,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alyona and a Square Jigsaw Puzzle\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alyona assembles an unusual square Jigsaw Puzzle. She does so in $$$n... | TestCase-Eval | null | {
"problem_id": "2047A",
"submission_id": 294746607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279211364,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279159802,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279164033,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279388367,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 280942901,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 280932763,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279759486,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279137290,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279284089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279219967,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 282922167,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279221355,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279221284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 282797909,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279195982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279156365,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279160287,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 279173102,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 280894686,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin... | TestCase-Eval | null | {
"problem_id": "2008E",
"submission_id": 281017917,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290774896,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 295335083,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290760052,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290746277,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290737393,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290739834,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290760333,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290733990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290726160,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290722465,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290743997,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290745253,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290761078,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290749809,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 300433851,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 292083030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290735058,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290732689,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290751486,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary... | TestCase-Eval | null | {
"problem_id": "2029B",
"submission_id": 290726922,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 298004676,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 289606285,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 289456008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 289606962,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 289606999,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 262622403,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 264117269,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 263224032,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 298009464,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 277249752,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 263224515,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 262619838,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 300512683,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 298004786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 262621137,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 263229573,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 263227067,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 264117719,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 264117789,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgott... | TestCase-Eval | null | {
"problem_id": "1975I",
"submission_id": 263227740,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255724587,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 261593553,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 256980326,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255718241,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255734771,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255720321,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 262565654,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255810816,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 270935258,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255793717,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 303414753,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255756934,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255770935,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 281617711,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255742746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255727662,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 255741894,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 266849955,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 256385856,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$... | TestCase-Eval | null | {
"problem_id": "1955D",
"submission_id": 259526463,
"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.