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: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253830908,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253805460,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253836028,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253760074,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253804133,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 281924317,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253822327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 254092019,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253812041,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253805579,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 260529469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253802753,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253774785,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253832903,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253939225,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 274065926,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253805594,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253821853,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 253805891,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that... | TestCase-Eval | null | {
"problem_id": "1950F",
"submission_id": 258253954,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263659279,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 292111083,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 283349788,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 265557333,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 289344025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263762372,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263393330,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 264378814,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263367738,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263365363,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263340805,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 292942242,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 291191622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263393454,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 269886709,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263398020,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263381223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263342587,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263676286,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Verte... | TestCase-Eval | null | {
"problem_id": "1976F",
"submission_id": 263676346,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 284297641,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 268443482,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 277634873,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 278014302,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 288896458,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 268212637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 268557946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 271941001,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 281135530,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 279059571,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 279068862,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 269082450,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 277636037,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 268766498,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 277645029,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 288898453,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 277651157,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 296144990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 277638924,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Hard Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the hard version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G2",
"submission_id": 277636757,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 270776594,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 282627731,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 272238229,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 273596446,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 296943075,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 281405276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 271709099,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 270714250,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 270712855,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 270703584,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 270848520,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 271433050,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 271421352,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 271419056,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 271970170,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 271170159,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 270746622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 270746847,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 271709718,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the m... | TestCase-Eval | null | {
"problem_id": "1988E",
"submission_id": 270780331,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 290111451,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 295965130,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289801073,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 295164185,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 291457547,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289527613,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289589100,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289587992,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289610853,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289586676,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289875897,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289826832,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289595373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 290373190,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289597498,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289855338,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289565096,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289565165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289520723,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse the Rivers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A conspiracy of ancient sages, who decided to redirect rivers for their own convenie... | TestCase-Eval | null | {
"problem_id": "2036E",
"submission_id": 289589702,
"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.