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: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 286676885,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 284976564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 284599834,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 288647791,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 285546401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 285546315,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 286060818,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 286043698,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 284599579,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 285548569,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 296474981,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 285544397,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 285023379,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 286059638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 284594302,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 284666534,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 284693706,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 284567329,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 287818597,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the cons... | TestCase-Eval | null | {
"problem_id": "2021E1",
"submission_id": 285156120,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253825032,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 256983214,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 255492373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 272614423,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253815352,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253882723,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253818697,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253922078,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 278720122,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253793468,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 302557238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 302557079,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 256205985,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253691254,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253800024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253777990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253724376,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 256098954,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 253790634,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$.... | TestCase-Eval | null | {
"problem_id": "1950G",
"submission_id": 254094957,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 293930629,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 296105983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 290376453,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287870882,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287866962,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 286788198,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287443468,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287295513,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287639122,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287511121,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 295678700,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 295307453,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 286773508,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 286763059,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 291559252,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 291559184,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287863942,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287512185,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 287511811,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version... | TestCase-Eval | null | {
"problem_id": "2030G2",
"submission_id": 289315379,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 261877640,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262232165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 261982540,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262014136,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 261842292,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262013370,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262153386,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262081711,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 261916900,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 263866247,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 284070346,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 279865241,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 261930157,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262008397,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 261900484,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 264623823,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262637611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262758188,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262140036,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Money Buys Happiness\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Being a physicist, Charlie likes to plan his life in simple and precise terms.\n\n... | TestCase-Eval | null | {
"problem_id": "1974E",
"submission_id": 262252427,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262598516,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 283317131,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262582303,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262586230,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262703606,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 265089633,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262598324,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262593074,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262611634,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262611551,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 291185526,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262597911,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 288931576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262605243,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262974184,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262610819,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262612835,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 283281799,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262612709,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two... | TestCase-Eval | null | {
"problem_id": "1975D",
"submission_id": 262595406,
"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.