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: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264921153,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264950637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 269214009,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264929835,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264936386,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264962618,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264927902,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 265481502,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264938401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 266026012,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264910701,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264965878,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264956434,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 268565083,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 288291675,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264887740,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 283932718,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 268436951,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 268641538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Magnitude (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions of the problem are different. You may want to read both versi... | TestCase-Eval | null | {
"problem_id": "1984C1",
"submission_id": 264906032,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 274263502,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273875075,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 274263966,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 295148552,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 275171090,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 296417615,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 274293516,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273595007,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273892381,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273592500,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 274022723,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273821560,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273789754,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273590958,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273675749,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273593261,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 298492108,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273792117,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273810619,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, number... | TestCase-Eval | null | {
"problem_id": "1997F",
"submission_id": 273789248,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267403130,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267382630,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 268415816,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 295155939,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267367841,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267402917,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267418373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267408657,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267383536,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267400867,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267413759,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267368420,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267428061,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267381175,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 268109656,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267390370,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267389284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267390064,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267960170,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain r... | TestCase-Eval | null | {
"problem_id": "1982D",
"submission_id": 267436429,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 261507840,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260367805,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260358499,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 269441478,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260406051,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260488367,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260432404,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 275919165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260340796,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260762239,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260403910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 261991079,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260483394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260356357,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260642575,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 263173418,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 262303524,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 298398488,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 260410078,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts... | TestCase-Eval | null | {
"problem_id": "1971E",
"submission_id": 266499279,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266122387,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266106094,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266061337,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266005497,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 265994100,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266003204,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 265982921,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266299503,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266251725,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 265978197,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266069798,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 265979437,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266024108,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 265993457,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 267847249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 265987450,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266011270,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 265997580,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266002174,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Alice and Books\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $n$ books. The $1$-st book contains $a_1$ pages, the $2$-nd book contains $a_... | TestCase-Eval | null | {
"problem_id": "1978A",
"submission_id": 266008131,
"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.