Datasets:
problem_id string | problem_statement string | tier string | base_problem string | base_rating int64 | source_url string | n_tests int64 | package_path string | package_sha256 string |
|---|---|---|---|---|---|---|---|---|
2145C | # Problem. Monocarp's String
## Time limit
2 seconds
## Memory limit
256 megabytes
Monocarp has a string $$$s$$$ of length $$$n$$$, consisting of the letters '
a
' and '
b
'. He wants to remove some (possibly zero) number of
consecutive
letters from his string in such a way that the number of letters '
a
' and '
b
'... | originals | 2145C | 1,300 | https://codeforces.com/contest/2145/problem/C | 49 | packages/originals/2145C.zip | 454245cc27f9bded38bf9fba89041b1d805cb8451bd5ac628edf3e968d6a1f11 |
2145E | # Problem. Predicting Popularity
## Time limit
3 seconds
## Memory limit
256 megabytes
Imagine that you are working at Berflix — the largest streaming service in Berland, specialized in movie distribution. The audience of this service consists of $$$n$$$ users, and for each of them, some preferences are known: the l... | originals | 2145E | 2,100 | https://codeforces.com/contest/2145/problem/E | 60 | packages/originals/2145E.zip | 4afbbe411d36e35a75021bbd4a6a0b54511bcb0b87d80b48bfbb4553dba3fd62 |
2145F | # Problem. Long Journey
## Time limit
2 seconds
## Memory limit
256 megabytes
There is a strip divided into cells, numbered from $$$0$$$ to $$$m$$$ from left to right. You are controlling a chip that is initially in the cell $$$0$$$.
There is a trap in each cell; they are activated according to the following rules:
... | originals | 2145F | 2,500 | https://codeforces.com/contest/2145/problem/F | 47 | packages/originals/2145F.zip | f335239b58d95e9fe990e2addfe5c45ddc01d4b77764487967cefee527052082 |
2152B | # Problem. Catching the Krug
## Time limit
1 second
## Memory limit
1024 megabytes
Doran and the Krug are playing a game on a grid consisting of $$$(n + 1) \times (n + 1)$$$ cells whose coordinates are pairs of integers from $$$0$$$ to $$$n$$$, inclusive. The Krug's goal is not to be
caught
by Doran for as long as p... | originals | 2152B | 1,300 | https://codeforces.com/contest/2152/problem/B | 60 | packages/originals/2152B.zip | 9062487478daa568352940c0e9fc29cfb93b6a83030fc584035bee38752367a3 |
2152C | # Problem. Triple Removal
## Time limit
2 seconds
## Memory limit
1024 megabytes
Tired of supporting ranged carries, Keria is now creating a data structure problem about supporting range queries.
For an array $$$b = [b_1, b_2, \ldots, b_m]$$$ of length $$$m$$$ where $$$b_i=0$$$ or $$$b_i=1$$$, consider the following... | originals | 2152C | 1,400 | https://codeforces.com/contest/2152/problem/C | 30 | packages/originals/2152C.zip | 268df69cfe4f2996fe8eb823ebd273d55b6d3a70b61c302f1a9ef3e94443afa9 |
2152D | # Problem. Division Versus Addition
## Time limit
2 seconds
## Memory limit
1024 megabytes
For an array $$$b=[b_1,b_2,\ldots,b_m]$$$ of length $$$m$$$ ($$$b_i \geq 2$$$), consider the following two-player game played by Poby and Rekkles.
The players take turns, with Poby moving first.
On Poby's turn, he must choose ... | originals | 2152D | 1,700 | https://codeforces.com/contest/2152/problem/D | 60 | packages/originals/2152D.zip | ec50ace221abc9b8cec06102f0529e0e26b2bbab3fc6466e3321cd98bc0d1264 |
2153C | # Problem. Symmetrical Polygons
## Time limit
2 seconds
## Memory limit
256 megabytes
You are given $$$n$$$ sticks, where the $$$i$$$-th stick has a length of $$$a_i$$$. You want to choose a non-empty subset of these sticks and use them as the sides of a polygon. Each selected stick must be used entirely as a single... | originals | 2153C | 1,500 | https://codeforces.com/contest/2153/problem/C | 45 | packages/originals/2153C.zip | b301f884dc5de7eee947c468f8741ae45c094f904b1bbdefaa29709008361737 |
2153D | # Problem. Not Alone
## Time limit
2 seconds
## Memory limit
256 megabytes
A circular array $$$b$$$ of length $$$m$$$ is
nice
if every element has at least one adjacent element$$$^{\text{∗}}$$$ that is equal to it. Formally, for every $$$1\le i\le m$$$, at least one of the following holds: $$$b_i = b_{(i+m-2)\bmod m... | originals | 2153D | 1,800 | https://codeforces.com/contest/2153/problem/D | 60 | packages/originals/2153D.zip | 149c8c1dc2d8c604590d9a8973d2da47ca8f08253144fbd9c478fc0b9d1a0916 |
2153E | # Problem. Zero Trailing Factorial
## Time limit
3 seconds
## Memory limit
512 megabytes
For all positive integers $$$x\ge 1$$$ and $$$k\ge 2$$$, let $$$v_k(x!)$$$ denote the number of trailing zeros in the base-$$$k$$$ representation of $$$x! = x\cdot (x-1)\cdot \ldots \cdot 1$$$. Formally, $$$v_k(x!)$$$ is defined... | originals | 2153E | 2,400 | https://codeforces.com/contest/2153/problem/E | 60 | packages/originals/2153E.zip | e7b1085e52d476e95f587bca3e24e477d955104d4b12861e04dfc01d417752d6 |
2154C1 | # Problem. No Cost Too Great (Easy Version)
## Time limit
3 seconds
## Memory limit
256 megabytes
This is the easy version of the problem. The difference between the versions is that in this version, $$$b_i = 1$$$ for all $$$i$$$ ($$$1 \le i \le n$$$). You can hack only if you solved all versions of this problem.
Yo... | originals | 2154C1 | 1,400 | https://codeforces.com/contest/2154/problem/C1 | 59 | packages/originals/2154C1.zip | 9aac24405f5431ea6742663eacdea275ac6050a483a1d44ee58953d25cfd4f89 |
2154C2 | # Problem. No Cost Too Great (Hard Version)
## Time limit
3 seconds
## Memory limit
256 megabytes
This is the hard version of the problem. The difference between the versions is that in this version, $$$1 \le b_i \le 10^9$$$ for all $$$i$$$ ($$$1 \le i \le n$$$). You can hack only if you solved all versions of this ... | originals | 2154C2 | 2,000 | https://codeforces.com/contest/2154/problem/C2 | 60 | packages/originals/2154C2.zip | a7310fd1ce0a747bba83f2477518f2f9ede4bcb99442d3b9b167d19c4e59681d |
2154E | # Problem. No Mind To Think
## Time limit
2 seconds
## Memory limit
256 megabytes
You are given an array of positive integers $$$a$$$ of length $$$n$$$ and a positive integer $$$k$$$, and you will play the following game with them:
At the start of the game, you will choose an
odd
integer $$$x$$$ ($$$1 \le x \le n$$$... | originals | 2154E | 2,500 | https://codeforces.com/contest/2154/problem/E | 60 | packages/originals/2154E.zip | 28004a1cc8669afa52efe83ae5c107e1160274c39572c8c9d0e59df62bc6b5fb |
2155C | # Problem. The Ancient Wizards' Capes
## Time limit
2 seconds
## Memory limit
256 megabytes
There are $$$n$$$ wizards in a row numbered $$$1$$$ to $$$n$$$ from left to right. Each wizard has an invisibility cape which can be worn either on his left side or on his right side. Harry walks from the position of wizard $... | originals | 2155C | 1,500 | https://codeforces.com/contest/2155/problem/C | 60 | packages/originals/2155C.zip | 6ffef2b9ab9dd2433d8a0ce016a44922b06cd2706fe153b6c279e0b93a652c5d |
2155E | # Problem. Mimo & Yuyu
## Time limit
2 seconds
## Memory limit
256 megabytes
Mimo and Yuyu just finished their 1000-piece jigsaw puzzle of beautiful Bellas Artes! Now they are looking for other ways to entertain themselves.
There is an $$$n \times m$$$ grid of cells with columns labeled $$$1, 2, \ldots m$$$ from lef... | originals | 2155E | 2,200 | https://codeforces.com/contest/2155/problem/E | 54 | packages/originals/2155E.zip | 34276485e21e58a51a625855d0fc865df981f68e68b4aad6ef28aa98f088cb56 |
2156C | # Problem. Maximum GCD on Whiteboard
## Time limit
2 seconds
## Memory limit
256 megabytes
You are given an integer $$$k$$$ and $$$n$$$ positive integers $$$a_1, a_2, \ldots, a_n$$$ written on a whiteboard, where $$$1\le a_i\le \boldsymbol{n}$$$. You may perform the following operations:
Erase
: Choose an integer fr... | originals | 2156C | 1,400 | https://codeforces.com/contest/2156/problem/C | 60 | packages/originals/2156C.zip | f999a09fc0bca1d8b8db6206992a637d0d01df57874f60420a635ce9ba6b3b07 |
2156E | # Problem. Best Time to Buy and Sell Stock
## Time limit
4 seconds
## Memory limit
256 megabytes
The
beauty
of an array $$$b$$$ of length $$$m$$$ (with $$$m \ge 2$$$) is defined as the largest value of $$$b_j - b_i$$$ over all pairs of indices $$$i$$$ and $$$j$$$ such that $$$1\le i \lt j\le m$$$. More formally, i... | originals | 2156E | 2,500 | https://codeforces.com/contest/2156/problem/E | 60 | packages/originals/2156E.zip | ee9827d04a3f7806d8c2eb44df4578b0d261f96176608c21b4e903d692a3d308 |
2156F1 | # Problem. Strange Operation (Easy Version)
## Time limit
4 seconds
## Memory limit
256 megabytes
This is the easy version of the problem. The difference between the versions is that in this version, the constraint on $$$n$$$ is smaller. You can hack only if you solved all versions of this problem.
You are given a p... | originals | 2156F1 | 2,200 | https://codeforces.com/contest/2156/problem/F1 | 60 | packages/originals/2156F1.zip | 1e8b7dcd01e8462940aecee8c3d088e866a67e1c3d33659e16e8c2b831ddef1f |
2157D | # Problem. Billion Players Game
## Time limit
2 seconds
## Memory limit
256 megabytes
NemesisTheory - Rose At Nightfall
⠀
You are following the world championship of the Billion Players Game. There are $$$10^9$$$ players competing, and you want to predict the final ranking $$$p$$$ of Godflex, your favorite streamer.... | originals | 2157D | 1,600 | https://codeforces.com/contest/2157/problem/D | 48 | packages/originals/2157D.zip | 2c641961214b84ba2608460858333afc7f96f61e8b128ec5413a72096f05f0b3 |
2157E | # Problem. Adjusting Drones
## Time limit
2 seconds
## Memory limit
256 megabytes
PIXL - This Time
⠀
You are managing a fleet of $$$n$$$ drones, each with an energy level $$$a_1, \ldots, a_n$$$. You are also given a positive integer $$$k$$$, which represents the maximum number of drones allowed to share the same ene... | originals | 2157E | 1,900 | https://codeforces.com/contest/2157/problem/E | 51 | packages/originals/2157E.zip | 372d360c462ed8a9b0b0d3024c4fe1e1a9b7b9422f72239db9af35b876669731 |
2158B | # Problem. Split
## Time limit
1 second
## Memory limit
256 megabytes
You are given a sequence $$$a$$$ containing $$$2n$$$ integers. Let $$$f(b)$$$ denote the number of distinct elements with an odd number of occurrences in sequence $$$b$$$. You need to split the given array into two disjoint subsequences $$$p$$$ an... | originals | 2158B | 1,200 | https://codeforces.com/contest/2158/problem/B | 53 | packages/originals/2158B.zip | 73192f2b968718fc7c9a3debbc6ed76f6589a49fef27da3935a8e5f125ccb888 |
2158C | # Problem. Annoying Game
## Time limit
2 seconds
## Memory limit
256 megabytes
You are given two integer arrays $$$a$$$ and $$$b$$$, both of length $$$n$$$, and a total number of turns $$$k$$$.
Alice and Bob play a game by taking turns modifying array $$$a$$$. Alice goes first. The game lasts for exactly $$$k$$$ tur... | originals | 2158C | 1,400 | https://codeforces.com/contest/2158/problem/C | 58 | packages/originals/2158C.zip | a8468afb64d1c3bcedf0495e114dba0540131b28b4024b71bf7e383985a0a648 |
2158E | # Problem. Sink
## Time limit
3 seconds
## Memory limit
256 megabytes
You are given a grid containing $$$n$$$ rows and $$$m$$$ columns. Every cell $$$(i, j)$$$, located in the $$$i$$$-th row and $$$j$$$-th column, has a positive integer value associated with it $$$a_{i, j}$$$. Two cells are adjacent if and only if t... | originals | 2158E | 2,600 | https://codeforces.com/contest/2158/problem/E | 56 | packages/originals/2158E.zip | 1255516cca8efb10f1b30f58a468a19e169482a16963cd2aeed6b760cd207f02 |
2159B | # Problem. Rectangles
## Time limit
4 seconds
## Memory limit
1024 megabytes
You are given a binary grid$$$^{\text{∗}}$$$ $$$G$$$ of dimensions $$$n \times m$$$.
Let us define a
rectangle
as a tuple $$$(u,d,l,r)$$$ that satisfies the following conditions:
$$$1 \le \boldsymbol{u \lt d} \le n$$$;
$$$1 \le \boldsymbo... | originals | 2159B | 2,100 | https://codeforces.com/contest/2159/problem/B | 60 | packages/originals/2159B.zip | 98ad14248834e9b47bd05219da9d75bb5057d95d32a3b09f471f30934cf87dd5 |
2159C | # Problem. Twin Polynomials
## Time limit
2 seconds
## Memory limit
256 megabytes
A polynomial $$$f(x) = a_0 + a_1x + a_2x^2 + \ldots + a_nx^n$$$ is called a valid polynomial of degree $$$n$$$ if and only if $$$a_i$$$ is a non-negative integer for all $$$0 \le i \le n$$$ and $$$a_n$$$ is not $$$0$$$.
For a valid pol... | originals | 2159C | 2,300 | https://codeforces.com/contest/2159/problem/C | 60 | packages/originals/2159C.zip | 63ce6f1980bb4e82cb232876df45018c438311bb2989aad1cc8720e13bb84338 |
2160C | # Problem. Reverse XOR
## Time limit
2 seconds
## Memory limit
256 megabytes
Given a
positive
integer $$$x$$$, let $$$f(x)$$$ be the positive integer formed by reversing the binary representation of $$$x$$$ without leading zeroes. For example, if $$$x=12=1100_2$$$, then $$$f(x)=0011_2=3$$$.
You are given an integer ... | originals | 2160C | 1,300 | https://codeforces.com/contest/2160/problem/C | 60 | packages/originals/2160C.zip | 8fd43430dfaeafdb206e4c6bd7f81d474294fa1ba21340b2bca70019ad9c30a9 |
2161B | # Problem. Make Connected
## Time limit
1.5 seconds
## Memory limit
512 megabytes
You are given an $$$n \times n$$$ grid where some cells are colored black, and the rest are white. You may paint some of the white cells black to achieve the following conditions:
There is at least one black cell.
All black cells must ... | originals | 2161B | 1,700 | https://codeforces.com/contest/2161/problem/B | 45 | packages/originals/2161B.zip | 1cd63b72eb684976bce3f4a8b2ede4ae2e06e02955bf26b630272bbf890cff7e |
2161D | # Problem. Locked Out
## Time limit
2 seconds
## Memory limit
512 megabytes
Who's a good array? You're a good array! (c)
An array $$$b$$$ is
good
if there do not exist indices $$$1 \leq i \lt j \leq |b|$$$ such that $$$b_j - b_i = 1$$$.
You are given an integer. array $$$a_1, a_2, \ldots, a_n$$$. Determine the
min... | originals | 2161D | 2,100 | https://codeforces.com/contest/2161/problem/D | 50 | packages/originals/2161D.zip | 6c2e9de3198090a55a86f4a62760daef05122468f898be293425785f95740b29 |
2163C | # Problem. Monopati
## Time limit
2 seconds
## Memory limit
256 megabytes
You are given a grid $$$a$$$ of $$$2$$$ rows and $$$n$$$ columns, where every cell has value from $$$1$$$ to $$$2n$$$.
Let $$$f(l, r)$$$, where $$$1 \le l \le r \le 2n$$$, represent a binary$$$^{\text{∗}}$$$ grid $$$b$$$ of $$$2$$$ rows and $$... | originals | 2163C | 1,500 | https://codeforces.com/contest/2163/problem/C | 54 | packages/originals/2163C.zip | 65d6b233d4856ce842dae787046825f16ed137e35f94001d38f91ec7c98e1659 |
2164C | # Problem. Dungeon
## Time limit
2 seconds
## Memory limit
256 megabytes
You are now in a dungeon with $$$n$$$ swords, facing $$$m$$$ monsters.
The damage of the $$$i$$$-th sword is $$$a_i$$$, and the life value of the $$$i$$$-th monster is $$$b_i$$$. A sword with damage $$$x$$$ can kill a monster with life value $$... | originals | 2164C | 1,400 | https://codeforces.com/contest/2164/problem/C | 54 | packages/originals/2164C.zip | 6c10823f1b9371c32acbbadf12614fedbc4b1cb0e99b65cb1d91a001c7e20bea |
2164D | # Problem. Copy String
## Time limit
2 seconds
## Memory limit
256 megabytes
Given two strings $$$s$$$ and $$$t$$$ of length $$$n$$$, you aim to transform $$$s$$$ into $$$t$$$ through a series of the following operations:
Construct a new string $$$s'$$$ of length $$$n$$$,where $$$s'_1=s_1$$$. For each $$$1 \lt i \... | originals | 2164D | 1,800 | https://codeforces.com/contest/2164/problem/D | 60 | packages/originals/2164D.zip | c91c3d0e24a18553cb39f539fd8218a364eeb198897b4fff86d8ffe3c9fb413e |
2164F1 | # Problem. Chain Prefix Rank (Easy Version)
## Time limit
5 seconds
## Memory limit
1024 megabytes
This is the easy version of the problem. The difference between the versions is that in this version, $$$n \le 5000$$$. You can hack only if you solved all versions of this problem.
Given a tree $$$T$$$ with $$$n$$$ ve... | originals | 2164F1 | 2,600 | https://codeforces.com/contest/2164/problem/F1 | 60 | packages/originals/2164F1.zip | 1e26c4539f1dc65b35c8ad2ac6c1b2c5575e83c37549c69788c204c8fc9bf317 |
2165A | # Problem. Cyclic Merging
## Time limit
2 seconds
## Memory limit
256 megabytes
You are given $$$n$$$ non-negative integers $$$a_1,a_2,\ldots,a_n$$$ arranged on a ring. For each $$$1\le i \lt n$$$, $$$a_i$$$ and $$$a_{i+1}$$$ are adjacent; $$$a_1$$$ and $$$a_n$$$ are adjacent.
You need to perform the following oper... | originals | 2165A | 1,300 | https://codeforces.com/contest/2165/problem/A | 60 | packages/originals/2165A.zip | fb2eb8db7cb97a26f695e04c1859b03f660f639181e172dfd950e946b271a3b3 |
2165B | # Problem. Marble Council
## Time limit
2 seconds
## Memory limit
512 megabytes
You are given a multiset $$$a$$$, which consists of $$$n$$$ integers $$$a_1,a_2,\ldots,a_n$$$. You would like to generate a new multiset $$$s$$$ through the following procedure:
Partition $$$a$$$ into any number of non-empty multisets $$... | originals | 2165B | 1,900 | https://codeforces.com/contest/2165/problem/B | 60 | packages/originals/2165B.zip | 1c3afb187cb4947016f462ce53173ceaf235238f5476c3b2f084b439a7625229 |
2165C | # Problem. Binary Wine
## Time limit
2 seconds
## Memory limit
512 megabytes
You are given $$$n$$$ integers $$$a_1,a_2,\ldots,a_n$$$ within the range $$$[0,2^{30})$$$.
You can spend $$$1$$$ coin to increase any $$$a_i$$$ by $$$1$$$. You can perform this operation any number of times.
You need to solve $$$q$$$ querie... | originals | 2165C | 2,000 | https://codeforces.com/contest/2165/problem/C | 53 | packages/originals/2165C.zip | 8e8dcdbb6442247244cead951fe22128a3b1c020f2c3b4e5e2967ada9f13dabe |
2165D | # Problem. Path Split
## Time limit
4 seconds
## Memory limit
512 megabytes
You are given a sequence of $$$n$$$ integers $$$a_1,a_2,\ldots,a_n$$$.
You would like to partition $$$a$$$ into several
subsequences
$$$^{\text{∗}}$$$ $$$b_1,b_2,\ldots,b_k$$$, satisfying the following conditions:
Each element in $$$a$$$ bel... | originals | 2165D | 2,500 | https://codeforces.com/contest/2165/problem/D | 42 | packages/originals/2165D.zip | 94d5e7cff9e9e06a00cb62a35be60a6dbf285959362ed2aab3d1241da17996db |
2167E | # Problem. khba Loves to Sleep!
## Time limit
3 seconds
## Memory limit
256 megabytes
khba has $$$n$$$ friends, each standing on a line at position $$$a_i$$$, and each of them is in the range $$$[0, x]$$$.
They all want to come to him. One of his friends, Isamatdin, gave him $$$k$$$ teleports. Each friend will walk ... | originals | 2167E | 1,600 | https://codeforces.com/contest/2167/problem/E | 52 | packages/originals/2167E.zip | 7d9e34c2e9e3e89fda46332e749db700392b9f80764d7c1f0acf65d9cc48787e |
2167F | # Problem. Tree, TREE!!!
## Time limit
2 seconds
## Memory limit
256 megabytes
Roots change, but the tree stands strong — so should your logic.
Behruzbek received
a tree
$$$^{\text{∗}}$$$ with $$$n$$$ nodes. For a chosen
root
$$$^{\text{†}}$$$ $$$r$$$, Behruzbek wants to find
cuteness
of the tree.
Consider every set... | originals | 2167F | 1,600 | https://codeforces.com/contest/2167/problem/F | 59 | packages/originals/2167F.zip | 3734e166898f7a242d5dff06e6c22ecf348f60fd5a0b7769fe88d6a8f6eac09f |
2167G | # Problem. Mukhammadali and the Smooth Array
## Time limit
1 second
## Memory limit
256 megabytes
Muhammadali has an integer array $$$a_1,\dots,a_n$$$. He can change (replace) any subset of positions; changing position $$$i$$$ costs $$$c_i$$$ and replaces $$$a_i$$$ with any integer of his choice. The positions that ... | originals | 2167G | 1,600 | https://codeforces.com/contest/2167/problem/G | 59 | packages/originals/2167G.zip | edc773b1595d163d7db5b62d7b292a7ee6e4c905026dc437c07ef81c865e66e6 |
2169C | # Problem. Range Operation
## Time limit
2 seconds
## Memory limit
512 megabytes
You are given an integer array $$$a$$$ of length $$$n$$$.
You can perform the following operation: choose a range $$$[l, r]$$$ ($$$1 \le l \le r \le n$$$) and replace the value of elements $$$a_l, a_{l+1}, \dots, a_r$$$ with $$$(l + r)$... | originals | 2169C | 1,300 | https://codeforces.com/contest/2169/problem/C | 50 | packages/originals/2169C.zip | 08a597d74629382b26b01cc9893283a25e8e7401ead2997b845438ead2a04cbd |
2169D1 | # Problem. Removal of a Sequence (Easy Version)
## Time limit
2 seconds
## Memory limit
512 megabytes
This is the easy version of the problem. The difference between the versions is the constraint on $$$x$$$; in this version, $$$x \le 10^5$$$.
Polycarp has a sequence of all natural numbers from $$$1$$$ to $$$10^{12}... | originals | 2169D1 | 1,500 | https://codeforces.com/contest/2169/problem/D1 | 60 | packages/originals/2169D1.zip | 4ab6a354e20239625dece236ed02088c8aec935c223746a5ef5ab573d6f35ede |
2169D2 | # Problem. Removal of a Sequence (Hard Version)
## Time limit
2 seconds
## Memory limit
512 megabytes
This is the hard version of the problem. The difference between the versions is the constraint on $$$x$$$; in this version, $$$x \le 10^{12}$$$.
Polycarp has a sequence of all natural numbers from $$$1$$$ to $$$10^{... | originals | 2169D2 | 2,100 | https://codeforces.com/contest/2169/problem/D2 | 60 | packages/originals/2169D2.zip | b06364bad8154fef5dc1917d5baef78994e38efee82ff14f3fac21c14212c355 |
2169E | # Problem. Points Selection
## Time limit
2 seconds
## Memory limit
512 megabytes
Alice and Bob are playing with points on the XY plane. Initially, there are $$$n$$$ points on the plane: the $$$i$$$-th point is located at $$$(x_i, y_i)$$$ and has a cost of $$$c_i$$$.
The game consists of two stages:
First, Alice sel... | originals | 2169E | 2,400 | https://codeforces.com/contest/2169/problem/E | 59 | packages/originals/2169E.zip | 78e61d69795b11a5c9d68253502e6864a4664a2dbd67a5887578b993d736c064 |
2170B | # Problem. Addition on a Segment
## Time limit
2 seconds
## Memory limit
512 megabytes
You start with an integer array $$$a$$$, which initially consists of $$$n$$$ zeros. You have to perform the following action
exactly
$$$n$$$ times:
choose two integers $$$l$$$ and $$$r$$$ ($$$1 \le l \le r \le n$$$) and assign $$$... | originals | 2170B | 1,200 | https://codeforces.com/contest/2170/problem/B | 54 | packages/originals/2170B.zip | 39145f7d13ba6e9ab8683fadbe0347fc0308b5437dbba0b57dba890d49f7d25f |
2170C | # Problem. Quotient and Remainder
## Time limit
2 seconds
## Memory limit
512 megabytes
You are given two integer arrays: $$$q_1, q_2, \dots, q_n$$$ and $$$r_1, r_2, \dots, r_n$$$, as well as an integer $$$k$$$.
You can perform the following operation any number of times (possibly zero):
Choose two integers $$$x$$$ ... | originals | 2170C | 1,300 | https://codeforces.com/contest/2170/problem/C | 59 | packages/originals/2170C.zip | c6666f1f4e31deffd39b8a8a495c1382e47af26868bd270113b26816e1d28851 |
2170D | # Problem. Almost Roman
## Time limit
3 seconds
## Memory limit
512 megabytes
Let's define a value of a string, consisting of letters "
XVI
", as follows:
the value of '
X
' is $$$10$$$;
the value of '
V
' is $$$5$$$;
the value of '
I
' is $$$1$$$ or $$$-1$$$: $$$-1$$$ if the next position contains a letter '
X
' or... | originals | 2170D | 2,200 | https://codeforces.com/contest/2170/problem/D | 51 | packages/originals/2170D.zip | 69fb02cb7ea2addf82c12cf6782864fcbfca5c33ae86090450e517375f85de0a |
2170E | # Problem. Binary Strings and Blocks
## Time limit
2 seconds
## Memory limit
512 megabytes
Define a
block
in a binary string (a string consisting of characters
0
and/or
1
) as its continuous substring of characters of the same type that cannot be extended either to the left or to the right. For example, in the strin... | originals | 2170E | 2,100 | https://codeforces.com/contest/2170/problem/E | 60 | packages/originals/2170E.zip | 1e5f74e7056cc6b531d0b286b86c2d74e2dd04adf7e166540459c2b97547ecef |
2170F | # Problem. Build XOR on a Segment
## Time limit
5 seconds
## Memory limit
512 megabytes
You are given an array of $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$, where all numbers are from $$$1$$$ to $$$2^{12} - 1$$$.
You have to process $$$q$$$ queries. Each query is defined by three integers $$$l_i, r_i, x_i$$$: you ... | originals | 2170F | 2,600 | https://codeforces.com/contest/2170/problem/F | 59 | packages/originals/2170F.zip | 4eedaf5d1dd07fca6421139d22f0bcf7556a7644b8c211a54c0e2c36ecc52efd |
2171C2 | # Problem. Renako Amaori and XOR Game (hard version)
## Time limit
2 seconds
## Memory limit
256 megabytes
Yup. I couldn't do this any longer. No. Freaking. Way.
— Renako Amaori
This is the hard version of the problem. The only difference between the easy and hard versions is that in the hard version, $$$a_i, b_i \l... | originals | 2171C2 | 1,400 | https://codeforces.com/contest/2171/problem/C2 | 60 | packages/originals/2171C2.zip | 89f713b70ab2a6db7f91ddc44ef1c2ab2f6da9ed2d66f68b208742eacfeea467 |
2171D | # Problem. Rae Taylor and Trees (easy version)
## Time limit
3 seconds
## Memory limit
256 megabytes
"To think a commoner would even fathom sitting next to me. Know your place!"
— Claire François
This is the easy version of the problem. The only difference between the easy and hard versions is that the hard version ... | originals | 2171D | 1,400 | https://codeforces.com/contest/2171/problem/D | 49 | packages/originals/2171D.zip | 647d9e388aae3b54674d574f7390b86a443f9201b93c8e52926d5e403aa85635 |
2171G | # Problem. Sakura Adachi and Optimal Sequences
## Time limit
4 seconds
## Memory limit
256 megabytes
"What a pain..."
— Hougetsu Shimamura
Adachi is in the middle of a generational crashout... over, uh, this problem! Yep, that's definitely it... anyways, please help her solve it!
You are given two arrays $$$a$$$ and... | originals | 2171G | 2,000 | https://codeforces.com/contest/2171/problem/G | 60 | packages/originals/2171G.zip | 09c85d9178abb5190a6c9367f1f1d64a50fb7a9c65b16ef53c96179942c0c35a |
2171H | # Problem. Shiori Miyagi and Maximum Array Score
## Time limit
4 seconds
## Memory limit
256 megabytes
"Are you stupid, Sendai-san?"
— Shiori Miyagi
For the cost of 5000 yen, Miyagi can ask Sendai to do whatever she wants! Today, Miyagi demands that Sendai make her an array... specifically, Miyagi only wants a very ... | originals | 2171H | 2,400 | https://codeforces.com/contest/2171/problem/H | 60 | packages/originals/2171H.zip | 1ddf0165ce5a28eecb945bcf0291b8e1b6c58598251faf909f3628d3047351c1 |
2172E | # Problem. Number Maze
## Time limit
1 second
## Memory limit
256 megabytes
At the "Number Maze," a mysterious code master stands guard. He blocks the path and smiles, saying: "Brave adventurer, passing through this gate will not be easy! An ancient numeric code, capable of being rearranged into numerous combination... | originals | 2172E | 1,200 | https://codeforces.com/contest/2172/problem/E | 60 | packages/originals/2172E.zip | cc39803e7c2cf39f20ff66a460c759b850c78e3da884bc08c99eaeb08e186b5b |
2172F | # Problem. Cluster Computing System
## Time limit
1 second
## Memory limit
256 megabytes
The ICPC company plans to build a cluster computing system consisting of $$$n$$$ servers. Each server has a
database protocol type
represented by a positive integer. Specifically, the $$$i$$$-th server has a protocol type $$$p_i... | originals | 2172F | 1,600 | https://codeforces.com/contest/2172/problem/F | 60 | packages/originals/2172F.zip | 4085e7c3f5dd90d25f04365fc489ead3690cb110c076ecfbe6e461ed4e2eb170 |
2172H | # Problem. Shuffling Cards with Problem Solver 68!
## Time limit
2 seconds
## Memory limit
256 megabytes
Aru loves playing card games (Poker, Texas hold 'em, Balatro, etc.) and she has perfected the art of shuffling cards, especially the
riffle
shuffle. She is playing with Mutsuki now, and it's her turn to shuffle t... | originals | 2172H | 2,500 | https://codeforces.com/contest/2172/problem/H | 60 | packages/originals/2172H.zip | 039187f8ea940ea7c4132d0e34b35fc584b4241423bb0a6ce802cf716d1077f0 |
2172I | # Problem. Birthday
## Time limit
1 second
## Memory limit
256 megabytes
Anon and Soyo are good friends. To celebrate Anon's birthday, Soyo decides to buy a cake. After careful selection, she chooses a round strawberry cake to share with Anon at home.
The cake is modeled as a circle centered at the origin $$$(0, 0)$... | originals | 2172I | 2,000 | https://codeforces.com/contest/2172/problem/I | 59 | packages/originals/2172I.zip | ee68ca6e8a3720cc3862dfe91ef4330d7c8dbba0cf65b7c027afc55b28008d9a |
2172J | # Problem. Sliding Tiles
## Time limit
4 seconds
## Memory limit
256 megabytes
You have a special sliding puzzle played on an $$$n \times n$$$ grid. This puzzle is slightly different from standard sliding puzzles: between each pair of adjacent columns, there is a vertical bar of height $$$h_i$$$ (for $$$1 \leq i \l... | originals | 2172J | 2,300 | https://codeforces.com/contest/2172/problem/J | 60 | packages/originals/2172J.zip | 8ec2cbe5c7b404a88fdeb992dd99e5f3c8b273dce1af66f3be032b5d97dd5a1d |
2172K | # Problem. Kindergarten Homework
## Time limit
2 seconds
## Memory limit
256 megabytes
Kenny is a kindergarten teacher who is teaching his students about math. To help them learn, he wants to give them homework in an enjoyable and non-annoying format – Number Search.
A Number Search puzzle is similar to a Word Searc... | originals | 2172K | 2,100 | https://codeforces.com/contest/2172/problem/K | 52 | packages/originals/2172K.zip | 2e97ae2ab8ead01554d4718def42b152830c4bc40a12cb337a61a34307661d4e |
2172L | # Problem. Maximum Color Segment
## Time limit
2 seconds
## Memory limit
256 megabytes
You are given a rope $$$n$$$ units long, where each unit is painted either red or black. The rope can be represented as a string of length $$$n$$$ consisting of characters
R
(red) and
B
(black). You are also given two integers $$$... | originals | 2172L | 2,300 | https://codeforces.com/contest/2172/problem/L | 60 | packages/originals/2172L.zip | 448c91dfd56d1fb8c6204aaa6800b8140d519938e97f5bb9caf7444127571701 |
2172M | # Problem. Maximum Distance To Port
## Time limit
1 second
## Memory limit
256 megabytes
There are $$$n$$$ cities numbered from $$$1$$$ to $$$n$$$, connected by $$$m$$$ bidirectional roads, each exactly $$$1$$$ kilometer long. The road network forms a connected simple graph.
Each city produces exactly one of $$$k$$$... | originals | 2172M | 1,300 | https://codeforces.com/contest/2172/problem/M | 59 | packages/originals/2172M.zip | fe55c446379228d6962d6416d2536398240d0c93163f520f7a023b8d11e97a13 |
2173C | # Problem. Kanade's Perfect Multiples
## Time limit
2 seconds
## Memory limit
256 megabytes
We've carved those memories into ourselves... No matter how hard they were, they're the lives we carried out!
—
Angel Beats!
In the afterlife school, Kanade studies a peculiar number game.
She gives you two integers $$$n$$$ a... | originals | 2173C | 1,400 | https://codeforces.com/contest/2173/problem/C | 60 | packages/originals/2173C.zip | 5bbb495977ee2a6d21a2c704f9871495e9d6ccfdad585f55fd69dd8c26204a80 |
2173D | # Problem. Taiga's Carry Chains
## Time limit
2 seconds
## Memory limit
256 megabytes
Miracles don't happen to those who just wait.
—
Toradora!
After classes at Ohashi High School, Ryuuji hands Taiga a positive integer $$$n$$$ and sets a simple challenge.
They will play for exactly $$$k$$$ moves. In a single move, T... | originals | 2173D | 1,900 | https://codeforces.com/contest/2173/problem/D | 59 | packages/originals/2173D.zip | 05ac202a66cc466cce63a6b3670e070ec199fb9f87401b23025bdbfdb0d9d86a |
2173F | # Problem. Isla's Memory Thresholds
## Time limit
6 seconds
## Memory limit
1024 megabytes
I hope one day, you'll be reunited with the one you cherish.
—
Plastic Memories
In the world of
Plastic Memories
, Isla is collecting $$$n$$$ memory fragments. The $$$i$$$-th fragment has size $$$a_i$$$, and the sizes are
non-... | originals | 2173F | 2,600 | https://codeforces.com/contest/2173/problem/F | 30 | packages/originals/2173F.zip | 12c45f899e3e519cebb6111bff059600a0c623930aff38950cbe0719d6d5c32d |
2174A | # Problem. Needle in a Haystack
## Time limit
2 seconds
## Memory limit
256 megabytes
You got lucky to know the answer to all important questions in the world. This time, the answer is the string $$$s$$$, consisting of lowercase English letters only. You want to hide this string.
You have another string $$$t$$$ also... | originals | 2174A | 1,200 | https://codeforces.com/contest/2174/problem/A | 60 | packages/originals/2174A.zip | 112e38a5b30e3fc42c23633fff021512d64d782889d798d2bfa27f7b35ac81f9 |
End of preview. Expand in Data Studio
AutoCode-RL fresh-CF
Executable training problems for AutoCode-RL: Reinforcement Learning for Code with Verifiable Synthetic Data. A frozen GPT-5.5 setter constructs harder and easier variants and verification packages; a separate GPT-OSS-20B solver learns from binary program-execution rewards.
| View | Problems | Description |
|---|---|---|
originals |
226 | Source Codeforces tasks with generated verification packages |
enhance |
84 | Harder generated variants |
simplify |
63 | Easier generated variants |
synthetic |
147 | enhance + simplify |
all_verified |
373 | originals + synthetic |
These views overlap and are not train/test partitions. The 226 original tasks
span 75 contests dated 2025-10-03 through 2026-06-30. base_problem joins each
variant to its original task. IDs, problem text and experimental test bytes
are preserved in this release.
Contents
train/*.jsonl: dataset-viewer-friendly task records.packages/<tier>/<problem_id>.zip: 373 self-contained problem packages.packages_manifest.json: archive hashes, byte sizes and test counts.file_manifest.json: SHA256 for every one of the 36,658 packaged files.seeds/verified_seeds.json: original source-task records for generation.training/slime/*.jsonl: frozen GRPO prompts and metadata for the three arms.sft/: optional 295/36 train/dev teacher-trace comparison data and token IDs.reference_alternatives/: separately documented compatibility references.
Each problem archive contains statement.txt, config.yaml, checker.cpp,
std.cpp, and numbered testdata/*.in / *.ans files. The complete pool
contains 17,583 test pairs. Packages occupy 25,492,334,651 bytes
uncompressed and 5,249,105,485 bytes compressed. These are generated tests,
not official Codeforces test archives.
Load task statements
Load any of the five task views directly:
from datasets import load_dataset
rows = load_dataset("anonymous1926/autocode-fresh-cf", "synthetic", split="train")
print(rows[0]["problem_id"], rows[0]["problem_statement"])
The JSONL columns are problem_id, problem_statement, tier, base_problem,
base_rating, source_url, n_tests, package_path and package_sha256.
base_rating describes the original task; it is not a new rating for its
variant. source_url points to the original Codeforces problem.
For training, use the companion code release:
python tools/prepare_dataset.py --dataset ../autocode-fresh-cf \
--subset synthetic --output work
# Or: --repo-id anonymous1926/autocode-fresh-cf instead of --dataset ...
This verifies archive hashes and converts the packages to the local judge's
layout. Use originals or all_verified for the other arms. The Python dataset
loader reads task records; it does not unpack executable test data.
SFT comparison data
The optional SFT comparison starts from 331 accepted Kimi K2.7 Code traces,
including 157 previously compressed reasoning traces. Its family split has
295 training examples (193 families) and 36 development examples (20 families),
with no family overlap. These are different views from the 373-task GRPO pool.
The trace text and token IDs are retained exactly; see sft/data_manifest.json
for hashes, token counts and the tokenizer identity. The code release contains
the fixed 32-update batch plan and preparation/training scripts.
Verification and reference notes
All 373 archives have been opened and all 36,658 file hashes verified against the source packages. All 746 checker/reference files pass a local C++17 syntax check. Test-pair IDs are contiguous and agree with each package configuration.
The archived std.cpp files remain the experimental originals. Separately,
reference_alternatives/ contains three references used in the later parent-task
evaluation: compiler-compatible accepted references for 2208D2 and 2202G1, and
a one-element boundary fix for 2225F. Their prior execution audits passed
20/20, 53/53 and 51/51 tests respectively. These alternatives do not replace
any archived checker, test, answer or reference program. Syntax checking alone
does not establish program correctness.
Provenance and terms
Original Codeforces statements retain their original source rights. The
contributors' own software and generated artifacts use the accompanying MIT
license to the extent those rights are held; this combined dataset uses
license: other. See DATA_LICENSE.md. The code release also
retains testlib and other third-party notices. The release includes no gated
LiveCodeBench-Pro tests, model weights, credentials or evaluation rollouts.
- Downloads last month
- 609