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: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288346771,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288356785,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288373908,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288370609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288658916,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288454375,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288371983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288373657,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 299245734,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288362385,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 296210786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288378990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288334090,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288340781,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288367760,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288359640,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288374806,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288659261,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 296158254,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.9... | TestCase-Eval | null | {
"problem_id": "2035E",
"submission_id": 288338210,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276231690,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276266224,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276540496,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276252159,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276225653,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 281693162,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276297096,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276237398,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276233467,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276335167,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276360790,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 279797286,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 283124973,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276211344,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276228977,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276145513,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276429983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 278189078,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276311660,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She a... | TestCase-Eval | null | {
"problem_id": "2000C",
"submission_id": 276190263,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282337109,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 283301963,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282350840,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282346506,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282339970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282281686,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282324892,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 284633253,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282417040,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282470077,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282288479,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282342662,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282368747,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282744711,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282356054,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282401337,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282391342,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 282345742,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 284272595,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother ar... | TestCase-Eval | null | {
"problem_id": "2014D",
"submission_id": 285680185,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 296226996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 295746625,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 296247838,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294415471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 298057563,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294416753,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294438491,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294429903,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 298996839,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 299513952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294428576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294434404,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294400347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294420227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 302892958,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 305468435,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294398753,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 298604932,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294399508,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Greedy Monocarp\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ chests; the $$$i$$$-th chest initially contains $$$a_i$$$ coins. For ... | TestCase-Eval | null | {
"problem_id": "2042A",
"submission_id": 294412592,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257674409,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 258020892,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257707107,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 258831683,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 279309987,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 258257955,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257683565,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257681740,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 258195158,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257837272,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257887966,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 258010534,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257865886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257683387,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257826396,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 279313783,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257720786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 273716559,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257725482,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the num... | TestCase-Eval | null | {
"problem_id": "1957E",
"submission_id": 257951689,
"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.