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: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 286081612,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285849974,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 286577059,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285844573,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 295463437,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 288432442,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 288986011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285904519,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 297999909,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285902281,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285880579,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285855755,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 287550558,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 286324159,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285935920,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285854107,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 285865526,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 286070848,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 286166030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, bo... | TestCase-Eval | null | {
"problem_id": "2025A",
"submission_id": 294497705,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 282634956,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 284798029,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 279350830,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 278835363,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 281945284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 281944242,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 281393019,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 281392689,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 279928684,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 278882694,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 278882576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 298113474,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 281935627,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 278842239,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 281455652,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 278913431,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 278860893,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 278831218,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 281100708,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eri and Expanded Sets\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Let there be a set that contains distinct positive integers. To expand the set to... | TestCase-Eval | null | {
"problem_id": "2006C",
"submission_id": 278854968,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262607646,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 263138978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262640895,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 270236099,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262612204,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 271390370,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262848382,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 267796351,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 279329528,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 296111212,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262606093,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262611570,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 269335902,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 269186407,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262619146,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262607504,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 263015699,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 294950266,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262693673,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices ar... | TestCase-Eval | null | {
"problem_id": "1975E",
"submission_id": 262698469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 291777743,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290904845,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290943853,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 292627940,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 292541298,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 292508887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 291694068,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290954478,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290961560,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290912537,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 292593938,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 292508762,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290946752,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 291923675,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 292302482,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290901743,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290896099,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290905967,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290954123,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice's Adventures in Addition\ntime_limit_ms: 3000\nmemory_limit_mb: 32\nDescription: Note that the memory limit is unusual.\n\nThe Cheshire Cat has a riddle f... | TestCase-Eval | null | {
"problem_id": "2028F",
"submission_id": 290975217,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273674304,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 274335098,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 282793986,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273643835,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273592445,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273921226,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273804471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273580406,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273839819,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273593878,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273548159,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273579159,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 274292989,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 274290223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273640927,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273587719,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273558673,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273572988,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273583385,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight ... | TestCase-Eval | null | {
"problem_id": "1997E",
"submission_id": 273642159,
"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.