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: Numeric String Template\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Kristina has an array $a$, called a template, consisting of $n$ integers. She also has $m$ strings, each consisting only of lowercase Lat... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2000C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that contains all distinct elements of $b$. The array $b$ is calle... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2030F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Robin Hood Archery\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: At such times archery was always the main sport of the day, for the Nottinghamshire yeomen were the best hand at the longbow in all merry Engl... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2014H",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Cases\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You're a linguist studying a mysterious ancient language. You know that\n\n 1. Its words consist only of the first $c$ letters of the Latin alphabet. 2... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1995D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: GCD-sequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: GCD (Greatest Common Divisor) of two integers $x$ and $y$ is the maximum integer $z$ by which both $x$ and $y$ are divisible. For example, $GCD(36, ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1980D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an array $a_1, a_2, \\ldots, a_n$ of positive integers.\n\nY... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2019A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁlvaro Obregón\n\nÁlvaro and José are the only candidates r... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2022C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Turtle and a MEX Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the problem, you can't choose the same integer twice or more.... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2003D2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Distanced Coloring\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You received an $n\\times m$ grid from a mysterious source. The source also gave you a magic positive integer constant $k$.\n\nThe source told... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2002A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: The Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard 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": "2005B2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Find Minimum Operations\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two integers $n$ and $k$.\n\nIn one operation, you can subtract any power of $k$ from $n$. Formally, in one operation, you ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2020A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Good Prefixes\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alex thinks some array is good if there exists some element that can be represented as the sum of all other elements (the sum of all other elements... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1985C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ is called a polygonal segment only if the following conditi... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1990F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Chips on a Line\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You have $n$ chips, and you are going to place all of them in one of $x$ points, numbered from $1$ to $x$. There can be multiple chips in each po... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1997F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Grid Puzzle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of size $n$.\n\nThere is an $n \\times n$ grid. In the $i$-th row, the first $a_i$ cells are black and the other cells are... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1990D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Level Up\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Monocarp is playing a computer game. He starts the game being level $1$. He is about to fight $n$ monsters, in order from $1$ to $n$. The level of the $... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1997E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Dyn-scripted Robot (Hard Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this version $k \\le 10^{12}$. You can make hacks only ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1993F2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Chain Queries\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree of $n$ vertices numbered from $1$ to $n$. Initially, all vertices are colored white or black.\n\nYou are asked to perform $q$ ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1975E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out of them.\n\nInitially, the tower doesn't have any cubes. I... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1977A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Complex Segments (Hard Version)\ntime_limit_ms: 13000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n⠀\n\nThis is the hard version of the problem. In this vers... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2018E2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Penacony\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: On Penacony, The Land of the Dreams, there exists $n$ houses and $n$ roads. There exists a road between house $i$ and $i+1$ for all $1 \\leq i \\leq n-1... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1996G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with the $i$-th pile initially containing $a_i$ stones.\n\nOn th... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2004E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Billetes MX (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is guaranteed that $q = 0$. You can make hacks only if both versions of t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2022E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: The Endspeaker (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 only need to output the minimum total cost of operations ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2027D1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $a_i$ stones. Players take turns making moves, with Alice g... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1991H",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Dora and C++\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Dora has just learned the programming language C++!\n\nHowever, she has completely misunderstood the meaning of C++. She considers it as two kinds o... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2007C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Let Me Teach You a Lesson (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy 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": "1995E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Fun Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vova really loves the [XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operation (denoted as $\\oplus$). Recently, when he was going to sleep,... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1994B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Maximize the Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are numbered from $1$ to $n$, and the root is the vertex $1$.... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1997D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm 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 multisets $S_1, S_2, \\ldots, S_k$, where $k$ is an arbitra... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2030E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Variable Damage\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Monocarp is gathering an army to fight a dragon in a videogame.\n\nThe army consists of two parts: the heroes and the defensive artifacts. Each h... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2025G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Robin Hood in Town\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Sherwood, we judge a man not by his wealth, but by his merit.\n\nLook around, the rich are getting richer, and the poor are getting poorer.... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2014C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Upload More RAM\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Oh no, the ForceCodes servers are running out of memory! Luckily, you can help them out by uploading some of your RAM!\n\nYou want to upload $n$ ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1987A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Beauty of the mountains\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita loves mountains and has finally decided to visit the Berlyand mountain range! The range was so beautiful that Nikita decided to ca... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1982D",
"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": "1972D1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$ vertices, rooted at vertex $1$. The $i$-th vertex has an ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1987E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequences$^{\\text{†}}$ of length $k$ ($k$ is odd) of this array ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1999F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Maximize the Largest Component (Easy 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": "1985H1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Decode\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In a desperate attempt to obtain your waifu favorite character, you have hacked into the source code of the game. After days of struggling, you finally fi... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1996E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Make All Equal\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given a cyclic array $a_1, a_2, \\ldots, a_n$.\n\nYou can perform the following operation on $a$ at most $n - 1$ times:\n\n * Let $m$ be ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2001A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Bus to Pénjamo\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ya vamos llegando a Péeeenjamoo ♫♫♫\n\nThere are $n$ families travelling to Pénjamo to witness Mexico's largest- ever \"walking a chicken on a lea... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2022A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Dora's Set\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Dora has a set $s$ containing integers. In the beginning, she will put all integers in $[l, r]$ into the set $s$. That is, an integer $x$ is initially... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2007A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Interesting Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versions is the constraint on $n$. You can make h... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1987F1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Yasya and the Mysterious Tree\ntime_limit_ms: 2500\nmemory_limit_mb: 512\nDescription: Yasya was walking in the forest and accidentally found a tree with $n$ vertices. A tree is a connected undirected graph with no cyc... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1980G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Set\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Define the binary encoding of a finite set of natural numbers $T \\subseteq \\\\{0,1,2,\\ldots\\\\}$ as $f(T) = \\sum\\limits_{i \\in T} 2^i$. For example, $... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1975F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Symmetric Encoding\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Polycarp has a string $s$, which consists of lowercase Latin letters. He encodes this string using the following algorithm:\n\n * first, he c... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1974B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: I Love 1543\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: One morning, Polycarp woke up and realized that $1543$ is the most favorite number in his life.\n\nThe first thing that Polycarp saw that day as soon... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2036D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as the maximum number of vertices on the simple paths from some... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2006E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Split the Multiset\ntime_limit_ms: 1000\nmemory_limit_mb: 512\nDescription: A multiset is a set of numbers in which there can be equal elements, and the order of the numbers does not matter. For example, $\\\\{2,2,4\\\... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1988A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs are on. To flip the state of a bulb means to turn it off if ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2020B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Ultra-Meow\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: K1o0n gave you an array $a$ of length $n$, consisting of numbers $1, 2, \\ldots, n$. Accept it? Of course! But what to do with it? Of course, calculat... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1992G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Cutting Game\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Alice and Bob were playing a game again. They have a grid of size $a \\times b$ ($1 \\le a, b \\le 10^9$), on which there are $n$ chips, with at mos... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1974F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Battle for Survive\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Eralim, being the mafia boss, manages a group of $n$ fighters. Fighter $i$ has a rating of $a_i$.\n\nEralim arranges a tournament of $n - 1$ b... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2013B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: 378QAQ and Mocha's Array\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, 378QAQ gave her an array $a$ consisting of $n$ positive integers as a gift.\n\nMocha thinks... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1975B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Two Screens\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There are two screens which can display sequences of uppercase Latin letters. Initially, both screens display nothing.\n\nIn one second, you can do o... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2025A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Photoshoot for Gorillas\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You really love gorillas, so you decided to organize a photoshoot for them. Gorillas live in the jungle. The jungle is represented as a g... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2000E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Range Minimum Sum\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: For an array $[a_1,a_2,\\ldots,a_n]$ of length $n$, define $f(a)$ as the sum of the minimum element over all subsegments. That is, $$f(a)=\\sum... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1988E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Legs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: It's another beautiful day on Farmer John's farm.\n\nAfter Farmer John arrived at his farm, he counted $n$ legs. It is known only chickens and cows live on ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1996A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Alice's Adventures in the Rabbit Hole\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice is at the bottom of the rabbit hole! The rabbit hole can be modeled as a tree$^{\\text{∗}}$ which has an exit at vert... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2028E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Triple Operations\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: On the board Ivy wrote down all integers from $l$ to $r$, inclusive.\n\nIn an operation, she does the following:\n\n * pick two numbers $x$ an... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1999E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm 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 values in the grid are $0$, $1$ or $2$.\n\nYou can perform th... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1983B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this version, instead of listing the number of petals for each flo... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1995B2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Maximum Multiple Sum\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $n$, find an integer $x$ such that:\n\n * $2 \\leq x \\leq n$. * The sum of multiples of $x$ that are less than or equa... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1985B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: D-Function\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $D(n)$ represent the sum of digits of $n$. For how many integers $n$ where $10^{l} \\leq n < 10^{r}$ satisfy $D(k \\cdot n) = k \\cdot D(n)$? Outp... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1985G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Minimize the Difference\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Zhan, tired after the contest, gave the only task that he did not solve during the contest to his friend, Sungat. However, he could not s... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2013D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks for $n$ days, numbered from day $1$ to day $n$. There are ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2021D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Mind Bloom\ntime_limit_ms: 5000\nmemory_limit_mb: 1024\nDescription: This is the way it always was.\n\nThis is the way it always will be.\n\nAll will be forgotten again soon...\n\nJellyfish is playing a one-player card... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1975I",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Digital Village (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the three versions, the constraints on $n$ and $m$ are different. You can make hacks o... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2021E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Turtle and Inversions (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is a hard 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": "2003E2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Make a Palindrome\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ consisting of $n$ integers.\n\nLet the function $f(b)$ return the minimum number of operations needed to make an arr... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2004F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Attribute Checks\ntime_limit_ms: 2500\nmemory_limit_mb: 512\nDescription: Imagine a game where you play as a character that has two attributes: \"Strength\" and \"Intelligence\", that are at zero level initially.\n\nDu... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2025D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Alice's Adventures in Permuting\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice mixed up the words transmutation and permutation! She has an array $a$ specified via three integers $n$, $b$, $c$: the arra... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2028B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm 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 sum of elements from $a_l$ to $a_r$ (i. e. $s(l,r) = \\sum\\... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2026D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: XORificator 3000\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has been giving gifts to Bob for many years, and she knows that what he enjoys the most is performing [bitwise XOR](http://tiny.cc/xor_wik... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2036F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Zimpha Fan Club\ntime_limit_ms: 12000\nmemory_limit_mb: 512\nDescription: One day, Zimpha casually came up with a problem. As a member of \"Zimpha fan club\", you decided to solve that problem. You are given two s... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1975G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the forest.\n\nThe Major Oak in Sherwood is known for its majesti... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2014B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Action Figures\ntime_limit_ms: 2500\nmemory_limit_mb: 512\nDescription: There is a shop that sells action figures near Monocarp's house. A new set of action figures will be released shortly; this set contains $n$ figur... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2026C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Sakurako's Test\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Sakurako will soon take a test. The test can be described as an array of integers $n$ and a task on it:\n\nGiven an integer $x$, Sakurako can per... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2008H",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1$. You can apply several (possibly zero) operations to the... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1988B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he has obtained $n$ pockets of peanuts, conveniently numbered ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2032F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Complex Segments (Easy Version)\ntime_limit_ms: 6000\nmemory_limit_mb: 256\nDescription: [Ken Arai - COMPLEX](https://soundcloud.com/diatomichail2/complex)\n\n⠀\n\nThis is the easy version of the problem. In this versi... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2018E1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perform two types of actions on it:\n\n * paint the entire colu... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1989F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Meaning Mean\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Pak Chanek has an array $a$ of $n$ positive integers. Since he is currently learning how to calculate the floored average of two numbers, he wants t... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2021A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Quintomania\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Boris Notkin composes melodies. He represents them as a sequence of notes, where each note is encoded as an integer from $0$ to $127$ inclusive. The ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2036A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: A+B Again?\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given a two-digit positive integer $n$, find the sum of its digits.\n\nInput: The first line contains an integer $t$ ($1 \\leq t \\leq 90$) — the numb... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1999A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Game in Tree (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In this version, $\\mathbf{u = v}$. You can make hacks only if both versions of the problem ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2013F1",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such that $u_i>u_j$ for all $j<i$; * a suffix maximum as an in... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1988F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Lattice Optimizing\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: Consider a grid graph with $n$ rows and $n$ columns. Let the cell in row $x$ and column $y$ be $(x,y)$. There exists a directed edge from $(x... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2002G",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Perform Operations to Maximize Score\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: I see satyam343. I'm shaking. Please more median problems this time. I love those. Please satyam343 we believe in you.\n\n— ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1998C",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Interesting Problem (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference between the two versions is the constraint on $n$. You can make h... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1987F2",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: XOR Sequences\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two distinct non-negative integers $x$ and $y$. Consider two infinite sequences $a_1, a_2, a_3, \\ldots$ and $b_1, b_2, b_3, \\ldots$... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1979B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Longest Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the set of all possible non-empty subsequences of $a$ without ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2001D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Set\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given a positive integer $k$ and a set $S$ of all integers from $l$ to $r$ (inclusive).\n\nYou can perform the following two-step operation any numbe... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2029A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nYou are given $n$ points on the $x$ axis, at increasing pos... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2019B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Splittable Permutations\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Initially, we had one array, which was a permutation of size $n$ (an array of size $n$ where each integer from $1$ to $n$ appears exactly... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1976E",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Binomial Coefficients, Kind Of\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, akshiM met a task that needed binomial coefficients to solve. He wrote a code he usually does that looked like this:\n\n... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2025B",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Turtle and Three Sequences\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Piggy gives Turtle three sequences $a_1, a_2, \\ldots, a_n$, $b_1, b_2, \\ldots, b_n$, and $c_1, c_2, \\ldots, c_n$.\n\nTurtle will ch... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "2003F",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Swap Dilemma\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given two arrays of distinct positive integers $a$ and $b$ of length $n$, we would like to make both the arrays the same. Two arrays $x$ and $y$ of ... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1983D",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all these $k$ chips need to be placed on the cells of the board... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1995A",
"task_type": "TestCase-Eval-Task1"
} |
[
{
"content": "**Task:**\nGenerate a challenging test input for the algorithm problem:\nTitle: Find the Car\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Timur is in a car traveling on the number line from point $0$ to point $n$. The car starts moving from point $0$ at minute $0$.\n\nThere are $k+1$ s... | TestCase-Eval-Task1 | TestCase-Eval | null | {
"problem_id": "1971E",
"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.