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: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 292507982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289344028,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289293295,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289292480,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289277653,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 290865344,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 299282967,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 299130491,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289356006,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 303724296,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289272350,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289306720,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289273326,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289301530,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289253652,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 290035253,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 292547777,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289280162,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289268952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Genokraken\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nUpon clearing the Waterside Area, Gretel has found a mons... | TestCase-Eval | null | {
"problem_id": "2032D",
"submission_id": 289281147,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 294542310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 298119320,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 305041193,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 300768832,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 301053539,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 301043799,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 303430490,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 301229736,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 295397121,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 295354166,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 297086307,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 298742884,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 297578016,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 296043908,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 294549641,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 298616564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 294718038,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 294914107,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 294545466,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Move Back at a Cost\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the f... | TestCase-Eval | null | {
"problem_id": "2046B",
"submission_id": 296201427,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 286073506,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 288431301,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285719200,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285766109,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285735793,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285739686,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 287183211,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 287183334,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 299568418,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285748930,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285721456,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285734576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285747049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285746842,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 291563354,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285728811,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285767399,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 286162691,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 285739035,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Asesino (Easy Version)\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, you can ask at most $$... | TestCase-Eval | null | {
"problem_id": "2022D1",
"submission_id": 286416077,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276628614,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 278170970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276576056,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276577294,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276613560,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 290491641,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 279828008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 278362849,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276603265,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276594296,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276609146,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276603493,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276635070,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 288032180,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276587710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276681576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276606089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 279970035,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 276605396,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Game with Doors\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $100$ rooms arranged in a row and $99$ doors between them; the $i$-th door co... | TestCase-Eval | null | {
"problem_id": "2004B",
"submission_id": 277569776,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 259433440,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 272083821,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 261104574,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 258833836,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 259329714,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 277952012,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 277771989,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 278652608,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 258508256,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 302848814,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 273013811,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 291082192,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 262255629,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 260520838,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 278698227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 259641913,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 260515463,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 260688746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 258563628,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they... | TestCase-Eval | null | {
"problem_id": "1965A",
"submission_id": 261969534,
"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.