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: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286774408,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286817778,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286796467,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 288604607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 287659843,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286737484,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286828598,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286802321,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286742734,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286790318,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286782808,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286806305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 287874849,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 287074648,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286756383,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286755900,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286793137,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286789078,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 290390477,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is eithe... | TestCase-Eval | null | {
"problem_id": "2030C",
"submission_id": 286801521,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 298935906,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 286627803,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 298513812,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 288878383,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 279786313,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 278673631,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 265288772,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 288069031,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 292177427,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 269008113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 272066318,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 268118824,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 265262046,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 265964521,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 265416451,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 265392187,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 272267798,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 268751844,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 265328967,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularl... | TestCase-Eval | null | {
"problem_id": "1985A",
"submission_id": 265325825,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 280042238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 275547814,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272996130,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 274577455,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 290346127,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 275024600,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272837332,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272838248,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272791979,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272847545,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272782747,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 295147697,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272824878,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272826456,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272822301,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272831018,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 277432998,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 273671607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 272833308,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one opera... | TestCase-Eval | null | {
"problem_id": "1996F",
"submission_id": 273397280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 272547580,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 258955320,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 258978888,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 277987531,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 258910038,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 259460941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 258977575,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 274115821,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 258977929,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 261581084,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 263426256,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 259338383,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 258922116,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 261222545,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 261140163,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 261583743,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 259538018,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 259537913,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 259003278,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array ... | TestCase-Eval | null | {
"problem_id": "1972F",
"submission_id": 259002165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 271110848,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 269537394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 259480457,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 288206921,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 288206888,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 290698987,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 299423703,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 285273648,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 262370247,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 280951171,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 264983155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 265674851,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 268498796,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 285273170,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 297177934,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 260583032,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 262022762,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 259480281,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 267630611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E1",
"submission_id": 266552712,
"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.