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: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 259718634,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 254077302,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253796824,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253828049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253853295,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253771274,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 254215041,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253897235,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253756268,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253764359,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253815420,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253826236,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 268679057,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253816208,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 256633252,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 254269056,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 254402933,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253784234,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 253916277,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nearly Shortest Repeating Substring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$ of length $$$n$$$ consisting of lowe... | TestCase-Eval | null | {
"problem_id": "1950E",
"submission_id": 254070502,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269395024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269259649,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269273049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269259836,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269280225,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269259204,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269655447,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269444265,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269291686,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269449831,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269754492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269256427,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269578644,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269434342,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269252202,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 281648126,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269841536,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269288487,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269298415,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Corner Twist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two grids of numbers $a$ and $b$, with $n$ rows and $m$ columns. All the val... | TestCase-Eval | null | {
"problem_id": "1983B",
"submission_id": 269260160,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 277059571,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276359199,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276292714,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 277889571,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276837492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 278645882,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 284781304,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 277712526,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 277197242,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276281416,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276241919,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 277463253,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 284999790,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 279065027,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276334844,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276345544,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 288821608,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276269630,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276258542,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Color Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have $n$ rectangles, the $i$-th of which has a width of $a_i$ and a height o... | TestCase-Eval | null | {
"problem_id": "2000F",
"submission_id": 276248236,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288954373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288944746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 295161591,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288559581,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288561744,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288545527,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 298846747,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288771756,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288598045,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288587165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 295471211,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 289431448,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288516989,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288582042,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288579873,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 299529351,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288619271,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288806421,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288911623,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sums of Segments\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: You are given a sequence of integers $[a_1, a_2, \\dots, a_n]$. Let $s(l,r)$ be the su... | TestCase-Eval | null | {
"problem_id": "2026D",
"submission_id": 288910921,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 286810874,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 298637498,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 287368205,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 289965600,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 286833932,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 293024140,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 293019212,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 287447890,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 293022928,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 286812019,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 295818091,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 292681993,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 293016692,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 287448157,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 292823885,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 292808691,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 286787232,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 288625103,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 287854994,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: MEXimize the Score\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Suppose we partition the elements of an array $b$ into any number $k$ of non-empty m... | TestCase-Eval | null | {
"problem_id": "2030E",
"submission_id": 287606980,
"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.