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: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259248850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259723877,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 260132488,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259299812,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 304672501,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259340978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259179428,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259279147,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259289594,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 295800925,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259244165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259514780,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 269477477,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259370935,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 260478358,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 260477887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 260890668,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259364288,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259805678,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n... | TestCase-Eval | null | {
"problem_id": "1968G2",
"submission_id": 259561915,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 282639264,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 283748685,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 282887565,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 295681694,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 295147196,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 296473940,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 282093861,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 282067710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 290036447,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 297172327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 295690602,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 295456466,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 282875149,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 283686568,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 284890227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 282443228,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 296362629,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 295316078,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 283136281,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guarant... | TestCase-Eval | null | {
"problem_id": "2013F2",
"submission_id": 283956148,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 272787687,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 277071046,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 275357993,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 272829015,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 272754281,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 273126757,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 294105032,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 285254132,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 278656094,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 299963488,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 272753030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 290352117,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 283078168,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 281096977,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 291328342,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 272919379,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 272758894,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 297661430,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 294105155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he cou... | TestCase-Eval | null | {
"problem_id": "1996A",
"submission_id": 280789532,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267858524,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267946154,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267083979,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267060281,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267420248,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 270445281,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 268611305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267212310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267134735,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267081419,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267621608,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267620983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 269842085,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267067046,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267190726,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267105681,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 267310570,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 270595337,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 295949533,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beautiful Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a_1, a_2, \\ldots, a_n$ and an integer $k$. You nee... | TestCase-Eval | null | {
"problem_id": "1986E",
"submission_id": 270823446,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 270260151,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 268721674,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 270442676,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 279723550,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 259482681,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 259474976,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 259989148,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 269455000,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 303724378,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 259496522,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 268860336,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 274559206,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 274556725,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 260805522,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 259748325,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 268655220,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 278482923,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 262800289,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 262800461,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F1",
"submission_id": 262801468,
"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.