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: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282492306,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282960482,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 283291667,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282714167,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 295678897,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282335795,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282593473,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 283922726,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282363320,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282573820,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282350943,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282711238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 299814333,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282718726,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 284338919,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282423883,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282356394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 282845322,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 286657597,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire ... | TestCase-Eval | null | {
"problem_id": "2014H",
"submission_id": 286622883,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 284134415,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 281690312,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276662888,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 280064214,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 277949168,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276612089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276873249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276701999,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276663898,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276613329,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276683522,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 280241921,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276626136,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276673823,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276632542,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276585541,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 280727862,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276656208,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276679930,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play... | TestCase-Eval | null | {
"problem_id": "2004C",
"submission_id": 276658976,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295079525,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295087574,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295353222,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295098905,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295074957,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295102104,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295162414,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295557090,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295077882,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295092583,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 306993837,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295695186,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 302238898,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 298336847,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 297707896,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295093774,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 300920502,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 295012963,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 298338184,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree Destruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Given a tree$$$^{\\text{∗}}$$$ with $$$n$$$ vertices. You can choose two vertices $$$a... | TestCase-Eval | null | {
"problem_id": "2050G",
"submission_id": 305589334,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285928602,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 287880084,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 286905186,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 295179935,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285879795,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 296271093,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285907122,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285891124,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285929143,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285998241,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 295204433,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 286130510,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285934510,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 299791796,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285971306,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 289044879,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 286377528,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285917083,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 285929972,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the most popular card game in Berland, a deck of $n \\times m$ cards is used. Each card ha... | TestCase-Eval | null | {
"problem_id": "2025E",
"submission_id": 286154243,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264488613,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264856397,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264448605,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264436498,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 269583197,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264428585,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264437273,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 266754714,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264426294,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264430002,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264461472,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264447245,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264435629,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264449376,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264502925,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264994341,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 271664874,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264624636,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264464314,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1... | TestCase-Eval | null | {
"problem_id": "1979A",
"submission_id": 264457031,
"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.