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: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255849960,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255747109,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 256109635,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 256095954,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255758170,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 286621637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 286621576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 256256049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255943067,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 256212763,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255762355,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255729857,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255761588,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 256683453,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 256150855,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 257483036,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255801535,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 256927755,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255761870,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". I... | TestCase-Eval | null | {
"problem_id": "1955H",
"submission_id": 255760803,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289813348,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289565051,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 290451475,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289592488,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289562029,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289556664,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289685326,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289508815,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 290248510,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 291576708,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289529231,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289503366,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289518151,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 293188989,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 298593770,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289538637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289499276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289593362,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 289532165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Anya and 1100\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: While rummaging through things in a distant drawer, Anya found a beautiful string $s$ con... | TestCase-Eval | null | {
"problem_id": "2036C",
"submission_id": 294681792,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298839943,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 299021872,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298852573,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298819153,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298836877,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298951588,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298814814,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298860253,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298829282,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298822665,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 299050691,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 302251769,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298877185,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298813276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298831416,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298822624,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298864971,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298829352,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298835537,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tender Carpenter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In his dream, Cocoly would go on a long holiday with no worries around him. So he woul... | TestCase-Eval | null | {
"problem_id": "2053A",
"submission_id": 298855228,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278645521,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 281678011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278191025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 281874825,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278275025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278174209,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278256700,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 280908568,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278147613,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 280668013,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278460139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 280117359,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278147773,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278355012,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278152809,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278147740,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 282847550,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278219145,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 278189607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D2",
"submission_id": 280909236,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297901690,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 301715732,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 302312327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 298674783,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297953661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 304523251,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297967690,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297884251,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297993850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 298068116,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 299745218,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297904960,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297957437,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297938030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 300812492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297932423,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 299309378,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 300472840,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 297879772,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Best Price\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A batch of Christmas trees has arrived at the largest store in Berland. $$$n$$$ customers ha... | TestCase-Eval | null | {
"problem_id": "2051E",
"submission_id": 298028085,
"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.