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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291601945,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 302464193,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 302696674,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291650754,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 296419107,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291644011,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291623142,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 293078205,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291581922,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 292435140,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291624407,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291653494,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 293929166,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291641317,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 292446597,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291592780,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291589053,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291618569,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291666348,
"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: Penchick and Modern Monument\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Amidst skyscrapers in the bustling metropolis of Metro Manila, the newest ... | TestCase-Eval | null | {
"problem_id": "2031A",
"submission_id": 291605472,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276356347,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 293740538,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 288448359,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276338442,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276305567,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276291364,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276845167,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276843516,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276274261,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 277476713,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 277104325,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276326449,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 276231245,
"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: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting s... | TestCase-Eval | null | {
"problem_id": "2000G",
"submission_id": 288835419,
"task_type": "TestCase-Eval-Task2-DO"
} |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7