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: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 266395459,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 263978139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264017730,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264001094,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264053664,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264059885,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264024688,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264029676,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264022238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 263993544,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 263986202,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264255271,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 276443280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264012725,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264002818,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264021232,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264034929,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 264281477,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 263992559,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by wh... | TestCase-Eval | null | {
"problem_id": "1980D",
"submission_id": 263975735,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 272715786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 256478733,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 256490603,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 256521905,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 258809056,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 256824377,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 258943621,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 256666751,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 259577160,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 281667926,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 257370351,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 272077708,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 257985500,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 256489411,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 261006843,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 261528787,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 256501889,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 257557705,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 278033601,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to pl... | TestCase-Eval | null | {
"problem_id": "1956B",
"submission_id": 257175045,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288145798,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288124910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288184606,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288996138,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288126417,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288211298,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288152806,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 289183318,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288200974,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288145803,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288138300,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 291557151,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288149034,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288149817,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288139994,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 292580551,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288134616,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288135930,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 289146095,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stalin Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Stalin Sort is a humorous sorting algorithm designed to eliminate elements which are out of... | TestCase-Eval | null | {
"problem_id": "2027B",
"submission_id": 288226056,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 262642016,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 262641562,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 275323771,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 287870858,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 280979787,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 278557777,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 288836409,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 273322383,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 261168602,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 289919505,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 271689241,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 260991553,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 265412446,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 262632715,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 261792575,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 280422416,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 277885022,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 265933317,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 288836692,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m... | TestCase-Eval | null | {
"problem_id": "1970E2",
"submission_id": 276005203,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274400961,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274380727,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 275736981,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274417988,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274546401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274406998,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274392588,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274400817,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 275465957,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274705413,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274505696,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274374521,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 290524654,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274392020,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274486717,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274371976,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274425444,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274375940,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274400651,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair ... | TestCase-Eval | null | {
"problem_id": "1993B",
"submission_id": 274386678,
"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.