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: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291642678,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 293515569,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 297398340,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 305102358,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 294599240,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291588732,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291609988,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 299570322,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291598830,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 292900022,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291594043,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 302003770,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291683625,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 306668850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291601393,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291611866,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291758251,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291600112,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291628915,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Penchick and Satay Sticks\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: Penchick and his friend Kohane are touring Indonesia, and their next stop is ... | TestCase-Eval | null | {
"problem_id": "2031B",
"submission_id": 291603755,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 288324702,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 265251455,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 265270816,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 268454996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 270857247,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 265231578,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 265250289,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 271203506,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 265324638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 278942897,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 265271409,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 287405588,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 279301828,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 265254008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 270954652,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 266959974,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 269067206,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 267100408,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 280248648,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. ... | TestCase-Eval | null | {
"problem_id": "1985B",
"submission_id": 265270915,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294152586,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294151770,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294146910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 295160469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294956922,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 304985223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 295764908,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294162164,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294664863,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 296298032,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294369829,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294406860,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294429535,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 300106963,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294152227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294887605,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294151492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 294144513,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 299413200,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Scrambled Scrabble\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are playing a word game using a standard set of $$$26$$$ uppercase English lett... | TestCase-Eval | null | {
"problem_id": "2045A",
"submission_id": 305067671,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 283050470,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 285541249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282130068,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282224069,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282209628,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282083383,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 283002171,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282064150,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282097201,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282092242,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282087288,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282061367,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282094782,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 283005113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282095589,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 299129257,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282098402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282117310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282162961,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$... | TestCase-Eval | null | {
"problem_id": "2013F1",
"submission_id": 282097868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 273199642,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271309814,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271237716,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271264010,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271234645,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271328720,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271288402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271460941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 277008951,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271251141,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271413349,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271415316,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 276010778,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 285021863,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271256973,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271261168,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271234801,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271262175,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271743554,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wooden Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a forest of $k$ rooted trees$^{\\text{β}}$. Lumberjack Timofey wants to cut d... | TestCase-Eval | null | {
"problem_id": "1994E",
"submission_id": 271257974,
"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.