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: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255690062,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255699138,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255691762,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 256046630,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255935335,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255755894,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 256433591,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 278347637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255712386,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 257686062,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 268535092,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255749418,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255746280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255705627,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255684465,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255654572,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255813384,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 263148062,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 255835004,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numb... | TestCase-Eval | null | {
"problem_id": "1955C",
"submission_id": 296144714,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 282740798,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278796517,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278850593,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278817802,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278807040,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 281700704,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278805555,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278808786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278813413,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 280251978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 281329584,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278854615,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278824155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 280016921,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278825910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278808498,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 278829825,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 293266651,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 280247413,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birth... | TestCase-Eval | null | {
"problem_id": "2007B",
"submission_id": 280483315,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 304982153,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 304969001,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 300548310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 305083134,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 305046829,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 304624307,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 304989524,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 304974808,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 294660310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 294879683,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 305030312,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 305100171,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 304996469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 304746951,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 295736893,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 302818418,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 305102509,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 302329922,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 294624876,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: X Aura\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Mount ICPC can be represented as a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$) and ... | TestCase-Eval | null | {
"problem_id": "2045G",
"submission_id": 297984114,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255733613,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 300126617,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255828115,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 257019729,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255747797,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255853698,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255745704,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255819924,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255844475,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 305436405,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 270445044,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 257024335,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 256617952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 256979993,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255810915,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255720466,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255792087,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255777561,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 281976619,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common ... | TestCase-Eval | null | {
"problem_id": "1955G",
"submission_id": 255847838,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 271358871,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 270098787,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 291537438,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 269927937,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 292144423,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 275483756,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 269922010,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 282717153,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 270325413,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 270541848,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 269963871,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 269996551,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 272000848,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 269993304,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 271410891,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 270252413,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 295537035,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 271159401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 269988334,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give N... | TestCase-Eval | null | {
"problem_id": "1992A",
"submission_id": 269965531,
"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.