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: Permutation Problem (Hard Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is the hard version of the problem. The only difference is that in this version $n \\leq 5 \\cdot 10^5$ and the sum of $n... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1986G2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$. The value of $i$-th node is $a_{i}$. There are $q$ queri... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1983G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesting problem related to an array of numbers.\n\nSuppose Niki... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1977C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the two versions are the allowed characters in $s$. In the ea... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1987G1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-array of length $\\ge 2$, $a[l, r] = [a_l, a_{l+1}, \\ldot... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1983F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cream has two parameters: price and tastiness.\n\nInitially, ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2026F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Alternating String\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako really loves alternating strings. She calls a string $s$ of lowercase Latin letters an alternating string if characters in the even p... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2008E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Clock and Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a clock labeled with the numbers $1$ through $12$ in clockwise order, as shown below.\n\n![](CDN_BASE_URL/d18290022594db5fbc2eb2c94222... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1971C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plane, extending from $(0,0,0)$ to $(x,y,z)$.\n\nNtarsis has a... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1985E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm 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_2$ pages, $\\ldots$, the $n$-th book contains $a_n$ pages.... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1978A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm 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 of $b_i$.\n\nYou can perform the following operation an unl... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2000F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\nAbsence makes the heart grow fonder. Marian sold her last... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2014E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a string $s$ of length $n$ containing only characters $\\textt... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2030D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h_i$ meters.\n\nEvery second, the wind will blow from the l... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1987C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among competitors and achieve success, she decided to write her own ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2000H",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Turtle and Inversions (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an easy version of this problem. The differences between the versions are the constraint on $m$ and $r_i < l_{i + 1}... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2003E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Sofia and the Lost Operations\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sofia had an array of $n$ integers $a_1, a_2, \\ldots, a_n$. One day she got bored with it, so she decided to sequentially apply $m... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1980C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: 378QAQ and Core\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: 378QAQ has a string $s$ of length $n$. Define the core of a string as the substring$^\\dagger$ with maximum lexicographic$^\\ddagger$ order.\n\nF... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1975H",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Choosing Cubes\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Dmitry has $$$n$$$ cubes, numbered from left to right from $$$1$$$ to $$$n$$$. The cube with index $$$f$$$ is his favorite.\n\nDmitry threw all th... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1980B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Two Friends\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp wants to throw a party. He has $$$n$$$ friends, and he wants to have at least $$$2$$$ of them at his party.\n\nThe $$$i$$$-th friend's best ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1969A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s_2 \\dots s_{n-1} s_{n}$$$ into $$$s_{n} s_1 s_2 \\dots s_... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1969B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the following operation: choose an element of the array and repla... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1969C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item has two parameters: $$$a_i$$$ (item price for Alice) and $... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1969D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Unique Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$. A subarray of $$$a$$$ is one of its contiguous subsequences (i. e. an array $$$[a_l, a_{l+... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1969E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Array Fix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the following operation any number of times (possibly zero): take any elem... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1948B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Stair, Peak, or Neither?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given three digits $$$a$$$, $$$b$$$, and $$$c$$$. Determine whether they form a stair, a peak, or neither.\n\n- A stair satisfie... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1950A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Upscaling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. Output a $$$2n \\times 2n$$$ checkerboard made of $$$2 \\times 2$$$ squares alternating '$$$\\texttt{#}$$$' and '$$$\... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1950B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 24-hour format divides the day into 24 hours from $$$00$$$ ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1950C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Product of Binary Decimals\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Let's call a number a binary decimal if it is a positive integer and all digits in its decimal notation are either $$$0$$$ or $$$1$$$.... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1950D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm 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 lowercase Latin characters. Find the length of the shortest st... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1950E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: 0, 1, 2, Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Find the minimum height of a rooted tree$$$^{\\dagger}$$$ with $$$a+b+c$$$ vertices that satisfies the following conditions:\n\n- $$$a$$$ vertices... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1950F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Shuffling Songs\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Vladislav has a playlist consisting of $$$n$$$ songs, numbered from $$$1$$$ to $$$n$$$. Song $$$i$$$ has genre $$$g_i$$$ and writer $$$w_i$$$. He... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1950G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Diverse Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Petr, watching Sergey's stream, came up with a matrix $$$a$$$, consisting of $$$n$$$ rows and $$$m$$$ columns (the number in the $$$i$$$-th row and ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1994A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Funny Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Vanya has a graph with $$$n$$$ vertices (numbered from $$$1$$$ to $$$n$$$) and an array $$$a$$$ of $$$n$$$ integers; initially, there are no edges in ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1994D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to paint it.\n\nFirst, Alice will paint every part of the ribbo... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1954A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using the following operation an arbitrary number of times (possi... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1954B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Colored Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: There are balls of $$$n$$$ different colors; the number of balls of the $$$i$$$-th color is $$$a_i$$$.\n\nThe balls can be combined into groups. E... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1954D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Chain Reaction\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: There are $$$n$$$ monsters standing in a row. The $$$i$$$-th monster has $$$a_i$$$ health points.\n\nEvery second, you can choose one alive monste... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1954E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Everything Nim\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game on $$$n$$$ piles of stones. On each player's turn, they select a positive integer $$$k$$$ that is at most the siz... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1965A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Folding Strip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have a strip of paper with a binary string $$$s$$$ of length $$$n$$$. You can fold the paper in between any pair of adjacent digits.\n\nA set o... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1965C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $$$n$$$ vertices and $$$m$$$ edges. Each vertex can be colo... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1991E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th appetizer has spiciness $$$a_i$$$, and the $$$i$$$-th main d... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1949B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Annual Ants' Gathering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Deep within a forest lies an ancient tree, home to $$$n$$$ ants living in $$$n$$$ tiny houses, indexed from $$$1$$$ to $$$n$$$, connected ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1949C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Dating\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are the developer of a dating app which ignores gender completely. The app has $$$n$$$ users, indexed from $$$1$$$ to $$$n$$$. Each user's profile fea... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1949F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Scooter\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: The Czech Technical University campus consists of $$$n$$$ buildings, indexed from $$$1$$$ to $$$n$$$. In each building, there can be a math class schedul... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1949G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Disks\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ disks in the plane. The center of each disk has integer coordinates, and the radius of each disk is a positive integer. No two disks ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1949I",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Dual Trigger\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ lamps numbered $$$1$$$ to $$$n$$$ lined up in a row, initially turned off. You can perform the following operation any number of t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1951A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Battle Cows\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There are $$$n$$$ cows participating in a coding tournament. Cow $$$i$$$ has a Cowdeforces rating of $$$a_i$$$ (all distinct), and is initially in po... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1951B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Ticket Hoarding\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: As the CEO of a startup company, you want to reward each of your $$$k$$$ employees with a ticket to the upcoming concert. The tickets will be on ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1951C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Yogurt Sale\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The price of one yogurt at the \"Vosmiorochka\" store is $$$a$$$ burles, but there is a promotion where you can buy two yogurts for $$$b$$$ burles.\n... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1955A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Progressive Square\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A progressive square of size $$$n$$$ is an $$$n \\times n$$$ matrix. Maxim chooses three integers $$$a_{1,1}$$$, $$$c$$$, and $$$d$$$ and cons... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1955B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Inhabitant of the Deep Sea\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: $$$n$$$ ships set out to explore the depths of the ocean. The ships are numbered from $$$1$$$ to $$$n$$$ and follow each other in asce... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1955C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Inaccurate Subsequence Search\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Maxim has an array $$$a$$$ of $$$n$$$ integers and an array $$$b$$$ of $$$m$$$ integers ($$$m \\le n$$$).\n\nMaxim considers an arr... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1955D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Long Inversions\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: A binary string $$$s$$$ of length $$$n$$$ is given. A binary string is a string consisting only of the characters '1' and '0'.\n\nYou can choose ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1955E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ integers, each integer of the sequence doesn't exceed $$$4$$$... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1955F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: GCD on a grid\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common divisor of two numbers. The greatest common divisor of two... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1955G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: The Most Reckless Defense\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are playing a very popular Tower Defense game called \"Runnerfield 2\". In this game, the player sets up defensive towers that atta... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1955H",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consisting of the characters '0' and '1'.\n\nYour task is to determ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1968B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Permutation Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bodya and Sasha found a permutation $$$p_1,\\dots,p_n$$$ and an array $$$a_1,\\dots,a_n$$$. They decided to play a well-known \"Permutation game... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1968D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Equal XOR Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Let us call an array $$$x_1,\\dots,x_m$$$ interesting if it is possible to divide the array into $$$k>1$$$ parts so that bitwise XOR of values... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1968F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Division + LCP (easy version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version $$$l=r$$$.\n\nYou are given a string $$$s$$$. For a fixed $$$k$$$, conside... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1968G1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Division + LCP (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. In this version $$$l\\le r$$$.\n\nYou are given a string $$$s$$$. For a fixed $$$k$$$, con... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1968G2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", for example \"(()((\".\n\nA balanced parentheses sequence is... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970A1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Balanced Unshuffle (Medium)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The differences with the easy version of this problem are highlighted in bold.\n\nA parentheses sequence is a string consisting of ch... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970A2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the input.\n\nA parentheses sequence is a string consisting of cha... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970A3",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Game on Tree (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The difference in this version is that $$$t=1$$$ and we work on an array-like tree.\n\nRon and Hermi... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970C1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Game on Tree (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the medium version of the problem. The difference in this version is that $$$t=1$$$ and we work on trees.\n\nRon and Hermione are p... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970C2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Game on Tree (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference in this version is the constraint on $$$t$$$.\n\nRon and Hermione are playing a ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970C3",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Arithmancy (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Professor Vector is preparing to teach her Arithmancy class. She needs to prepare $$$n$$$ distinct magic words for the class. Each magic word i... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970D1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Trails (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$$ cabins, numbered 1 to $$$m$$$. Each cabin is connected, ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Trails (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$$ cabins, numbered 1 to $$$m$$$. Each cabin is connected... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970E2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$$ cabins, numbered 1 to $$$m$$$. Each cabin is connected, ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970E3",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Playing Quidditch (Easy)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk outside. As you come near the Quidditch field, you hear s... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970F1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Playing Quidditch (Medium)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk outside. As you come near the Quidditch field, you hear... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970F2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk outside. As you come near the Quidditch field, you hear s... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970F3",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $$$v$$$ for all $$$u, v$$$ ($$$1 \\leq u, v \\leq n$$$).\n\... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970G1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Min-Fund Prison (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m \\leq 300$$$\n\nAfter a worker's strike organized by the D... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970G2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\leq 5 \\times 10^{5}$$$\n\nAfter a worker's strike organize... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1970G3",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number of regular (equal-sided) polygons you can construct simul... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1957A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: How Does the Rook Move?\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an $$$n \\times n$$$ chessboard where you and the computer take turns alternatingly to place white rooks & black rooks on t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1957C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples ($$$x, y, z$$$) such that:\n\n- $$$1 \\leq x \\leq y \\leq ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1957D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Carousel of Combinations\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You are given an integer $$$n$$$. The function $$$C(i,k)$$$ represents the number of distinct ways you can select $$$k$$$ distinct numbe... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1957E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed integer $$$k$$$. You can perform the following operation ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1966A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Rectangle Filling\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is an $$$n \\times m$$$ grid of white and black squares. In one operation, you can select any two squares of the same color, and color al... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1966B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$$k$$$ if it satisfies the following:\n\n- The sum of $$$a_... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1983A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Cat, Fox and Maximum Array Split\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nFox gave Cat two positive integers $$$n$$$ and $$$k$$$. She has a hidden array $$$a_1, \\ldot... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1973D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Novice's Mistake\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: One of the first programming problems by K1o0n looked like this: \"Noobish_Monk has $$$n$$$ $$$(1 \\le n \\le 100)$$$ friends. Each of them gave... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1992E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, a_k$$$.\n\nIn this game, initially $$$n$$$ players are lin... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1956A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Nene and the Card Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You and Nene are playing a card game. The deck with $$$2n$$$ cards is used to play this game. Each card has an integer from $$$1$$$ to $$$... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1956B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. The $$$j$$$-th element of the $$$i$$$-th row of matrix $$$... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1956C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Nene and the Mex Operator\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nene gave you an array of integers $$$a_1, a_2, \\ldots, a_n$$$ of length $$$n$$$.\n\nYou can perform the following operation no more t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1956D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Permutation Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You have some cards. An integer between $$$1$$$ and $$$n$$$ is written on each card: specifically, for each $$$i$$$ from $$$1$$$ to $$$n$$$,... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1967A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Reverse Card (Easy 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": "1967B1",
"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": "1967B2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{∗}}$$$ $$$p$$$ of length $$$n$$$.\n\nFind a permutation $$$q$$$ of length $$$n$$$ that minimi... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1998B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, indexed from $$$1$$$ to $$$n$$$, and asked you to guess it ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2001C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: King Keykhosrow's Mystery\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a tale about the wise King Keykhosrow who owned a grand treasury filled with treasures from across the Persian Empire. However... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2034A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Rakhsh's Revival\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Rostam's loyal horse, Rakhsh, has seen better days. Once powerful and fast, Rakhsh has grown weaker over time, struggling to even move. Rostam w... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2034B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Trapped in the Witch's Labyrinth\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: In the fourth labor of Rostam, the legendary hero from the Shahnameh, an old witch has created a magical maze to trap him. The m... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2034C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Darius' Wisdom\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Darius the Great is constructing $$$n$$$ stone columns, each consisting of a base and between $$$0$$$, $$$1$$$, or $$$2$$$ inscription pieces stac... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2034D",
"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.