data_source stringclasses 1 value | prompt listlengths 1 1 | ability stringclasses 1 value | reward_model null | extra_info dict |
|---|---|---|---|---|
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 280783279,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 279041074,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 281794017,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 303244878,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 282002261,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 280150459,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 285599868,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 281328044,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 282969295,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 281331185,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 280000490,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 279483046,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 283114315,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 299083566,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 278563452,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 280756222,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 303295480,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 288411287,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 281930440,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alternating Sum of Numbers\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence of integers. Output the alternating sum of this seq... | TestCase-Eval | null | {
"problem_id": "2010A",
"submission_id": 279679197,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275831165,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275839767,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275998446,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275824311,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275851177,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275824733,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 279975619,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275815712,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275842250,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 278176902,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275827277,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 277513253,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275830529,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275816937,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275838996,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275835563,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275845830,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275825344,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 275836629,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: DFS Checker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, the given tree is ... | TestCase-Eval | null | {
"problem_id": "2002D1",
"submission_id": 284180079,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 261161826,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 265970145,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 272703497,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 265969862,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 281087776,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 280970422,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 260222896,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 274696090,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 292622000,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 297317671,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 287232961,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 259572403,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 269811488,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 273957673,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 259596259,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 259596149,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 280802735,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 287279060,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 280803988,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$... | TestCase-Eval | null | {
"problem_id": "1970D1",
"submission_id": 304785227,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296753352,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 297295413,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296763882,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296744024,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296674145,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 297201495,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296733037,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296875095,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296981097,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 297110398,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296716381,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296647880,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 297010856,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296684018,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296941432,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 304865458,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296690638,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296695906,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 296615603,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Easy Demon Problem\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: For an arbitrary grid, Robot defines its beauty to be the sum of elements in the gri... | TestCase-Eval | null | {
"problem_id": "2044F",
"submission_id": 301038343,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 293463288,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 293463964,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 293463242,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 279732961,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 275721311,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 275003274,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 287157147,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 282387439,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 274795871,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 274756731,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 290669179,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 279732914,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 282997068,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 282387435,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 293472770,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 296514415,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 289891203,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 283260637,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 274879794,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line... | TestCase-Eval | null | {
"problem_id": "1999A",
"submission_id": 274805250,
"task_type": "TestCase-Eval-Task2-DO"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.