prompt listlengths 1 1 | data_source stringclasses 1 value | ability stringclasses 1 value | reward_model null | extra_info dict |
|---|---|---|---|---|
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the two versions is the definition of deterministic max-heap, t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2001E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Coin Games\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $n$ coins on the table forming a circle, and each coin is either facing up or facing down. Alice and Bob take turns to play the following ga... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1972B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is that in this version $n \\leq 10^5$ and the sum of $n$ for a... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1986G1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: The Destruction of the Universe (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, $n \\leq 10^6$. You can only make hacks if both versions... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2030G2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Splitting Items\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob have $n$ items they'd like to split between them, so they decided to play a game. All items have a cost, and the $i$-th item costs ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2004C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: X Axis\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given three points with integer coordinates $x_1$, $x_2$, and $x_3$ on the $X$ axis ($1 \\leq x_i \\leq 10$). You can choose any point with an int... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1986A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Let Me Teach You a Lesson (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of a problem. The only difference between an easy and a hard version is the constraints on $t$ ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1995E2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: The Strict Teacher (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only differences between the two versions are the constraints on $m$ and $q$. In t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2005B1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Kousuke's Assignment\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: After a trip with Sakurako, Kousuke was very scared because he forgot about his programming assignment. In this assignment, the teacher gave... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2033D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Billetes MX (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, it is guaranteed that $q \\leq 10^5$. You can make hacks only if both versio... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2022E2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but with a twist.\n\nTo play the game, Alice draws a straight li... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2020D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strings $t_1, t_2, \\ldots, t_k$ ($k$ is an arbitrary integer) ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2003A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.\n\nTo control the lights in these rooms, the owner of the... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1993C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some integer $1 \\leq i \\leq n$. For example, one possible gr... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1971H",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permutation of integers from $1$ to $n \\cdot m$.\n\nA permutat... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1980E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"here is the chink of gold.\"\n\nThe folk hero Robin Hood h... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2014F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: XOUR\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ consisting of $n$ nonnegative integers.\n\nYou can swap the elements at positions $i$ and $j$ if $a_i~\\mathsf{XOR}~a_j < 4$, whe... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1971G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Remove Bridges\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices, numbered from $1$ to $n$. Vertex $1$ is the root. Additionally, the root only has one chi... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1976F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Bit Game (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you need to output the winner of the game in this version, and the ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2027E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: New Rating\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Hello, Codeforces Forcescode!\n\n\n\nKevin used to be a participant of Codeforces. Recently, the KDOI Team has developed a new Online Judge called For... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2029C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick is $a_i$.\n\nYou need to answer $q$ queries. In each query,... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1991F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if all of its digits are large.\n\nYou are given an integer ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1984B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Make Three Regions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a grid, consisting of $2$ rows and $n$ columns. Each cell of the grid is either free or blocked.\n\nA free cell $y$ is reachable from... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1997B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Parity and Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an array $a$ of $n$ positive integers.\n\nIn one operation, you can pick any pair of indexes $(i, j)$ such that $a_i$ and $a_j$ have distinc... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1993B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Robert Hood and Mrs Hood\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Impress thy brother, yet fret not thy mother.\n\nRobin's brother and mother are visiting, and Robin gets to choose the start day for eac... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2014D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Guess the Maximum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob came up with a rather strange game. They have an array of integers $a_1, a_2,\\ldots, a_n$. Alice chooses a certain integer $k$ a... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1979A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Increase/Decrease/Copy\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two integer arrays: array $a$ of length $n$ and array $b$ of length $n+1$.\n\nYou can perform the following operations any n... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1976B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white. To do this, you are given $n$ stamps. Each stamp is a rec... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2027A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\n\n * The root of the tree is a node marked with number $... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2020F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Kar Salesman\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Karel is a salesman in a car dealership. The dealership has $n$ different models of cars. There are $a_i$ cars of the $i$-th model. Karel is an exce... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2022B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Even Positions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp had a regular bracket sequence $s$ of length $n$ ($n$ is even). He even came up with his own way to calculate its cost.\n\nHe knows that ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1997C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: DFS Checker (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the hard version of the problem. In this version, you are given a generic tree and the constraints on $n$ and $q$ are higher. ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2002D2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Call During the Journey\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You live in a city consisting of $n$ intersections and $m$ streets connecting some pairs of intersections. You can travel in either direc... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2000G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Test of Love\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: ErnKor is ready to do anything for Julen, even to swim through crocodile- infested swamps. We decided to test this love. ErnKor will have to swim ac... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1992D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Creating Words\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Matthew is given two strings $a$ and $b$, both of length $3$. He thinks it's particularly funny to create two new words by swapping the first char... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1985A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Maximize the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one operation, you will remove two adjacent elements from the array... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1991A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Tree Operations\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This really says a lot about our society.\n\nOne day, a turtle gives you a tree with $n$ nodes rooted at node $x$. Each node has an initial nonne... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2035F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n$.\n\nPortals are used to move between cities. There are $... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2004D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do the following:\n\n * Choose a position $i$ such that $1 < i... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2027C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Expected Power\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are given an array of $n$ integers $a_1,a_2,\\ldots,a_n$. You are also given an array $p_1, p_2, \\ldots, p_n$.\n\nLet $S$ denote the random m... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2020E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: The Destruction of the Universe (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, $n \\leq 5000$. You can only make hacks if both versions... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2030G1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Sakurako's Task\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako has prepared a task for you:\n\nShe gives you an array of $n$ integers and allows you to choose $i$ and $j$ such that $i \\neq j$ and $a... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2008G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Showering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: As a computer science student, Alex faces a hard challenge — showering. He tries to shower daily, but despite his best efforts there are always challen... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1999C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, so read statements of both problems completely and carefull... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1985H2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Circuit\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has just crafted a circuit with $n$ lights and $2n$ switches. Each component (a light or a switch) has two states: on or off. The lights and switch... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2032A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Catch the Coin\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp visited a retro arcade club with arcade cabinets. There got curious about the \"Catch the Coin\" cabinet.\n\nThe game is pretty simple. T... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1989A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Sakurako's Box\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako has a box with $n$ balls. Each ball has it's value. She wants to bet with her friend that if the friend randomly picks two balls from the... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2008F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Primary Task\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Dmitry wrote down $t$ integers on the board, and that is good. He is sure that he lost an important integer $n$ among them, and that is bad.\n\nThe ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2000A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Only Pluses\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give Noobish_Monk $a \\times b \\times c$ bananas.\n\nNoobish_Mo... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1992A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Squaring\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: ikrpprpp found an array $a$ consisting of integers. He likes justice, so he wants to make $a$ fair — that is, make it non-decreasing. To do that, he can... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1995C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Black Circles\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ circles on a two-dimensional plane. The $i$-th circle is centered at $(x_i,y_i)$. Initially, all circles have a radius of $0$.\n\nThe... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2002C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie! You shake hands with the orangutan and offer him some foo... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2030A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Scale\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Tina has a square grid with $n$ rows and $n$ columns. Each cell in the grid is either $0$ or $1$.\n\nTina wants to reduce the grid by a factor of $k$ ($k$ ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1996B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Iris and Adjacent Products\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Iris has just learned multiplication in her Maths lessons. However, since her brain is unable to withstand too complex calculations, s... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2006D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Sakurako and Water\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: During her journey with Kosuke, Sakurako and Kosuke found a valley that can be represented as a matrix of size $n \\times n$, where at the int... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2033B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Startup\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Arseniy came up with another business plan — to sell soda from a vending machine! For this, he purchased a machine with $n$ shelves, as well as $k$ bottl... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2036B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy Programmer\n\nThis is the easy version of the problem. The... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1998E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ball has a value associated with it.\n\nThe players play t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1983E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the elections, numbered from $1$ to $n$. The $i$-th candidate has $a_i... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1978D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Paint the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a tree with $n$ vertices. Initially, all vertices are white.\n\nThere are two chess pieces called $P_A$ and $P_B$ on the tree. $P_A$ an... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1975D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For each person, we know their attitude towards the first movie ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1989C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\le i\\le n-1$, there is an undirected edge between vertex ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2029F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but the minimum amount required to open this deposit is $b$ coin... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2024A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Submission Bait\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in an array $a$ of size $n$.\n\nThey take turns to do operations, with Alice starting first. The player who can ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1990A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of them play against each other. The winner gets $2$ points w... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1973A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Contest Proposal\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A contest contains $n$ problems and the difficulty of the $i$-th problem is expected to be at most $b_i$. There are already $n$ problem proposal... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1972A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Index and Maximum Value\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: After receiving yet another integer array $a_1, a_2, \\ldots, a_n$ at her birthday party, Index decides to perform some operations on it.... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2007B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Game in Tree (Hard Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version, it is not guaranteed that $u = v$. You can make hacks only if both versions... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2013F2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm 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 connects rooms $i$ and $i+1$. Each door can be either locked... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2004B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Long Way to be Non-decreasing\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Little R is a magician who likes non-decreasing arrays. She has an array of length $n$, initially as $a_1, \\ldots, a_n$, in which ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1972F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Monster\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Man, this Genshin boss is so hard. Good thing they have a top-up of $6$ coins for only $ \\$4.99$. I should be careful and spend no more than I need to, ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2035E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non-negative integer $x$.\n\nA subarray of an array is called... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1982E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions. You can make hacks only if both versions are solved.\n\n... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1972D2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Turtle and Piggy Are Playing a Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a number game.\n\nFirst, Turtle will choose an integer $x$, such that $l \\le x \\le r$, where $... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1981A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\n— satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,b,c$) of positive integers such that $ab + ac + bc \\le n$... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1996D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Zhan's Blender\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Today, a club fair was held at \"NSPhM\". In order to advertise his pastry club, Zhan decided to demonstrate the power of his blender.\n\nTo demon... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2013A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to answer $q$ queries.\n\nFor each query, you are given a rang... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1996C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: ''a'' String Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $s$ consisting of lowercase Latin characters. Count the number of nonempty strings $t \\neq$ \"$\\texttt{a}$\" such t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1984D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters are on a tree with $n$ vertices. On vertex with number $i$ ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1988D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Smithing Skill\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a famous computer game (that just works) where you have various skills you can level up. Today, you focused on the \"Smithing\" sk... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1989D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Sliding\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Red was ejected. They were not the imposter.\n\nThere are $n$ rows of $m$ people. Let the position in the $r$-th row and the $c$-th column be denoted by ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2035A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative integer. The integer lying at the intersection of the $i$-t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1993E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are integers between $-m$ and $m$, inclusive.\n\nYou are given an ar... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1984F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Turtle and Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given a sequence $a_1, a_2, \\ldots, a_n$, and Turtle goes firs... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2003B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Bomb\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sparkle gives you two arrays $a$ and $b$ of length $n$. Initially, your score is $0$. In one operation, you can choose an integer $i$ and add $a_i$ to your ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1996F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th card has exactly one integer $a_i$ written on it.\n\nAt t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2025C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two vertices $(u, v)$ and has a probability of $\\frac{p}{q}$ o... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2029H",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version, you can only buy $h_i = 1$ unit of happiness each month, ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1974G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Right Left Wrong\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vlad found a strip of $n$ cells, numbered from left to right from $1$ to $n$. In the $i$-th cell, there is a positive integer $a_i$ and a letter... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2000D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Boring Day\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: On another boring day, Egor got bored and decided to do something. But since he has no friends, he came up with a game to play.\n\nEgor has a deck of ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1982C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Bouquet (Easy Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The only difference is that in this version, the flowers are specified by enumeration.\n\nA girl ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1995B1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: A TRUE Battle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There is a list of $n$ booleans, each of which is either true or false, given as a binary string $^{\\text{∗}}$ o... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2030C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the characters 0 and 1.\n\nThere is also a computing machine tha... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1978E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance from $(0, 0)$ greater than or equal to $r$ but strictly l... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1971F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Alice's Adventures in ''Chess''\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice is trying to meet up with the Red Queen in the countryside! Right now, Alice is at position $(0, 0)$, and the Red Queen is ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2028A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Black Cells\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a strip divided into cells, numbered from left to right from $0$ to $10^{18}$. Initially, all cells are white.\n\nYou can perform the f... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2026B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Replacement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a binary string$^{\\text{∗}}$ $s$ of length $n$, and Iris gives you another binary string $r$ of length $n-1$.\n\nIris is going to play a ga... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2029B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Turtle and a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the problem, you can choose the same integer twice or more. Y... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2003D1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: K-Sort\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array of integers $a$ of length $n$.\n\nYou can apply the following operation any number of times (maybe, zero):\n\n * First, choose an ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1987B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Go Learn! (Easy Version)\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: The differences between the easy and hard versions are the constraints on $n$ and the sum of $n$. In this version, $n \\leq 3000$ and th... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2035G1",
"task_type": "TestCase-Eval-Task1"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.