Problem ID stringlengths 2 6 | Problem Description stringlengths 0 7.52k | Rating float64 800 3.5k | math bool 2
classes | greedy bool 2
classes | implementation bool 2
classes | dp bool 2
classes | data structures bool 2
classes | constructive algorithms bool 2
classes | brute force bool 2
classes | binary search bool 2
classes | sortings bool 2
classes | graphs bool 2
classes | __index_level_0__ int64 3 9.98k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
130A | Problem - 130A - Codeforces =============== xa0 . Output Output the _n_-th hexagonal number. Examples Input 2 Output 6 Input 5 Output 45 | 900 | false | false | true | false | false | false | false | false | false | false | 9,363 |
493C | Vasya follows a basketball game and marks the distances from which each team makes a throw. He knows that each successful throw has value of either 2 or 3 points. A throw is worth 2 points if the distance it was made from doesn't exceed some value of _d_ meters, and a throw is worth 3 points if the distance is larger t... | 1,600 | false | false | true | false | true | false | true | true | true | false | 7,861 |
1210F1 | This is an easier version of the problem. In this version, $$$n le 6$$$. Marek is working hard on creating strong testcases to his new algorithmic problem. You want to know what it is? Nah, we're not telling you. However, we can tell you how he generates the testcases. Marek chooses an integer $$$n$$$ and $$$n^2$$$ int... | 3,100 | false | false | false | false | false | false | true | false | false | false | 4,631 |
721A | Recently Adaltik discovered japanese crosswords. Japanese crossword is a picture, represented as a table sized _a_u2009×u2009_b_ squares, and each square is colored white or black. There are integers to the left of the rows and to the top of the columns, encrypting the corresponding row or column. The number of integer... | 800 | false | false | true | false | false | false | false | false | false | false | 6,931 |
1761D | Problem - 1761D - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - ... | 2,100 | true | false | false | false | false | false | false | false | false | false | 1,745 |
366C | Dima, Inna and Seryozha have gathered in a room. That's right, someone's got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something. Dima and Seryozha have _n_ fruits in the fridge. Each fruit has two parameters: the taste and the number of calories. Inna decided to make a fruit sala... | 1,900 | false | false | false | true | false | false | false | false | false | false | 8,368 |
263D | You've got a undirected graph _G_, consisting of _n_ nodes. We will consider the nodes of the graph indexed by integers from 1 to _n_. We know that each node of graph _G_ is connected by edges with at least _k_ other nodes of this graph. Your task is to find in the given graph a simple cycle of length of at least _k_u2... | 1,800 | false | false | false | false | false | false | false | false | false | true | 8,780 |
1945B | One of the days of the hike coincided with a holiday, so in the evening at the camp, it was decided to arrange a festive fireworks display. For this purpose, the organizers of the hike bought two installations for launching fireworks and a huge number of shells for launching. Both installations are turned on simultaneo... | 900 | true | false | false | false | false | false | false | false | false | false | 612 |
1466C | After his wife's tragic death, Eurydice, Orpheus descended to the realm of death to see her. Reaching its gates was uneasy, but passing through them proved to be even more challenging. Mostly because of Cerberus, the three-headed hound of Hades. Orpheus, a famous poet, and musician plans to calm Cerberus with his poetr... | 1,300 | false | true | false | true | false | false | false | false | false | false | 3,364 |
1651F | Monocarp is playing a tower defense game. A level in the game can be represented as an OX axis, where each lattice point from $$$1$$$ to $$$n$$$ contains a tower in it. The tower in the $$$i$$$-th point has $$$c_i$$$ mana capacity and $$$r_i$$$ mana regeneration rate. In the beginning, before the $$$0$$$-th second, eac... | 3,000 | false | false | false | false | true | false | true | true | false | false | 2,363 |
1735C | There was a string $$$s$$$ which was supposed to be encrypted. For this reason, all $$$26$$$ lowercase English letters were arranged in a circle in some order, afterwards, each letter in $$$s$$$ was replaced with the one that follows in clockwise order, in that way the string $$$t$$$ was obtained. You are given a strin... | 1,400 | false | true | true | false | false | false | false | false | false | true | 1,878 |
1841C | No, not "random" numbers. Ranom digits are denoted by uppercase Latin letters from A to E. Moreover, the value of the letter A is $$$1$$$, B is $$$10$$$, C is $$$100$$$, D is $$$1000$$$, E is $$$10000$$$. A Ranom number is a sequence of Ranom digits. The value of the Ranom number is calculated as follows: the values of... | 1,800 | true | true | false | true | false | false | true | false | false | false | 1,243 |
344B | Mad scientist Mike is busy carrying out experiments in chemistry. Today he will attempt to join three atoms into one molecule. A molecule consists of atoms, with some pairs of atoms connected by atomic bonds. Each atom has a valence number — the number of bonds the atom must form with other atoms. An atom can form one ... | 1,200 | true | false | false | false | false | false | true | false | false | true | 8,457 |
1202D | The subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. You are given an integer $$$n$$$. You have to find a sequence $$$s$$$ consisting of digits $$${1, 3, 7}$$$ such that it has exactly $$$n$$$ subsequences equal to $$$133... | 1,900 | true | false | false | false | false | true | false | false | false | false | 4,686 |
1976C | Monocarp is opening his own IT company. He wants to hire $$$n$$$ programmers and $$$m$$$ testers. There are $$$n+m+1$$$ candidates, numbered from $$$1$$$ to $$$n+m+1$$$ in chronological order of their arriving time. The $$$i$$$-th candidate has programming skill $$$a_i$$$ and testing skill $$$b_i$$$ (a person's program... | 1,600 | false | true | true | true | false | false | false | true | false | false | 431 |
1482D | Arkady has a playlist that initially consists of $$$n$$$ songs, numerated from $$$1$$$ to $$$n$$$ in the order they appear in the playlist. Arkady starts listening to the songs in the playlist one by one, starting from song $$$1$$$. The playlist is cycled, i.xa0e. after listening to the last song, Arkady will continue ... | 1,900 | false | false | true | false | true | false | false | false | false | false | 3,264 |
183B | The Zoo in the Grid Kingdom is represented by an infinite grid. The Zoo has _n_ observation binoculars located at the _OX_ axis. For each _i_ between 1 and _n_, inclusive, there exists a single binocular located at the point with coordinates (_i_,u20090). There are _m_ flamingos in the Zoo, located at points with posit... | 1,700 | false | false | false | false | false | false | true | false | false | false | 9,108 |
1057C | There are $$$n$$$ candy boxes in front of Tania. The boxes are arranged in a row from left to right, numbered from $$$1$$$ to $$$n$$$. The $$$i$$$-th box contains $$$r_i$$$ candies, candies have the color $$$c_i$$$ (the color can take one of three values u200bu200b— red, green, or blue). All candies inside a single box... | 2,000 | false | false | false | true | false | false | false | false | false | false | 5,422 |
1719B | A new entertainment has appeared in Buryatia — a mathematical circus! The magician shows two numbers to the audience — $$$n$$$ and $$$k$$$, where $$$n$$$ is even. Next, he takes all the integers from $$$1$$$ to $$$n$$$, and splits them all into pairs $$$(a, b)$$$ (each integer must be in exactly one pair) so that for e... | 800 | true | false | false | false | false | true | false | false | false | false | 1,967 |
1913E | You are given a matrix $$$a$$$, consisting of $$$n$$$ rows by $$$m$$$ columns. Each element of the matrix is equal to $$$0$$$ or $$$1$$$. You can perform the following operation any number of times (possibly zero): choose an element of the matrix and replace it with either $$$0$$$ or $$$1$$$. You are also given two arr... | 2,400 | false | false | false | false | false | false | false | false | false | true | 821 |
1799H | You are given a tree with $$$n$$$ vertices. A hero $$$k$$$ times do the following operation: Choose some edge. Remove it. Take one of the two remaining parts and delete it. Write the number of vertices in the remaining part. You are given an initial tree and the a sequence of written numbers. Find the number of way... | 3,200 | false | false | false | true | false | false | false | false | false | false | 1,476 |
1027D | Medicine faculty of Berland State University has just finished their admission campaign. As usual, about $$$80%$$$ of applicants are girls and majority of them are going to live in the university dormitory for the next $$$4$$$ (hopefully) years. The dormitory consists of $$$n$$$ rooms and a single mouse! Girls decided ... | 1,700 | false | false | false | false | false | false | false | false | false | true | 5,573 |
1834F | Recently, Polycarp was given an unusual typewriter as a gift! Unfortunately, the typewriter was defective and had a rather strange design. The typewriter consists of $$$n$$$ cells numbered from left to right from $$$1$$$ to $$$n$$$, and a carriage that moves over them. The typewriter cells contain $$$n$$$ distinct inte... | 2,500 | true | false | false | false | false | false | true | false | false | false | 1,279 |
1658F | The cuteness of a binary string is the number of $$$ exttt{1}$$$s divided by the length of the string. For example, the cuteness of $$$ exttt{01101}$$$ is $$$frac{3}{5}$$$. Juju has a binary string $$$s$$$ of length $$$n$$$. She wants to choose some non-intersecting subsegments of $$$s$$$ such that their concatenation ... | 2,700 | true | true | false | false | false | true | true | false | false | false | 2,333 |
1680B | There is a field divided into $$$n$$$ rows and $$$m$$$ columns. Some cells are empty (denoted as E), other cells contain robots (denoted as R). You can send a command to all robots at the same time. The command can be of one of the four types: move up; move right; move down; move left. When you send a command, all ... | 800 | false | false | true | false | false | false | false | false | false | false | 2,190 |
1499G | You are given a bipartite graph consisting of $$$n_1$$$ vertices in the first part, $$$n_2$$$ vertices in the second part, and $$$m$$$ edges, numbered from $$$1$$$ to $$$m$$$. You have to color each edge into one of two colors, red and blue. You have to minimize the following value: $$$sum limits_{v in V} r(v) - b(v)$$... | 3,100 | false | false | false | false | true | false | false | false | false | true | 3,169 |
1445B | There is a famous olympiad, which has more than a hundred participants. The Olympiad consists of two stages: the elimination stage, and the final stage. At least a hundred participants will advance to the final stage. The elimination stage in turn consists of two contests. A result of the elimination stage is the total... | 900 | true | true | false | false | false | false | false | false | false | false | 3,448 |
44C | School holidays come in Berland. The holidays are going to continue for _n_ days. The students of school №_N_ are having the time of their lives and the IT teacher Marina Sergeyevna, who has spent all the summer busy checking the BSE (Berland State Examination) results, has finally taken a vacation break! Some people a... | 1,300 | false | false | true | false | false | false | false | false | false | false | 9,767 |
1527C | The weight of a sequence is defined as the number of unordered pairs of indexes $$$(i,j)$$$ (here $$$i lt j$$$) with same value ($$$a_{i} = a_{j}$$$). For example, the weight of sequence $$$a = [1, 1, 2, 2, 1]$$$ is $$$4$$$. The set of unordered pairs of indexes with same value are $$$(1, 2)$$$, $$$(1, 5)$$$, $$$(2, 5)... | 1,600 | true | false | true | false | false | false | false | false | false | false | 3,026 |
1398C | You are given an array $$$a_1, a_2, dots , a_n$$$ consisting of integers from $$$0$$$ to $$$9$$$. A subarray $$$a_l, a_{l+1}, a_{l+2}, dots , a_{r-1}, a_r$$$ is good if the sum of elements of this subarray is equal to the length of this subarray ($$$sumlimits_{i=l}^{r} a_i = r - l + 1$$$). For example, if $$$a = [1, 2,... | 1,600 | true | false | false | true | true | false | false | false | false | false | 3,684 |
316B1 | In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those around them is so little that some even stand in queues to several rooms at the same time in the clinic, running from one queue to another. (Cultural note: standing in huge and disorganized queues for hours is a native t... | 1,500 | false | false | false | false | false | false | true | false | false | false | 8,581 |
28B | Problem - 28B - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - so... | 1,600 | false | false | false | false | false | false | false | false | false | true | 9,857 |
370E | At school Vasya got an impressive list of summer reading books. Unlike other modern schoolchildren, Vasya loves reading, so he read some book each day of the summer. As Vasya was reading books, he was making notes in the Reader's Diary. Each day he wrote the orderal number of the book he was reading. The books in the l... | 2,500 | false | true | false | true | false | false | false | false | false | false | 8,349 |
1909H | You are given a permutation $$$p_1, p_2, dots, p_n$$$ of $$$[1, 2, dots, n]$$$. You can perform the following operation some (possibly $$$0$$$) times: choose a subarray $$$[l, r]$$$ of even length; swap $$$a_l$$$, $$$a_{l+1}$$$; swap $$$a_{l+2}$$$, $$$a_{l+3}$$$ (if $$$l+3 leq r$$$); $$$dots$$$ swap $$$a_{r-1}$$$,... | 3,500 | false | false | false | false | true | true | false | false | false | false | 849 |
1702C | Along the railroad there are stations indexed from $$$1$$$ to $$$10^9$$$. An express train always travels along a route consisting of $$$n$$$ stations with indices $$$u_1, u_2, dots, u_n$$$, where ($$$1 le u_i le 10^9$$$). The train travels along the route from left to right. It starts at station $$$u_1$$$, then stops ... | 1,100 | false | true | false | false | true | false | false | false | false | false | 2,068 |
1988E | 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_{l=1}^nsum_{r=l}^n min_{lle ile r}a_i.$$$$$$ A permutation is a sequence of integers from $$$1$$$ to $$$n$$$ of length $$$n$$$ containing each number exactly once. ... | 2,300 | false | false | true | false | true | false | true | true | false | false | 343 |
1503E | Problem - 1503E - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - ... | 3,100 | true | false | false | true | false | false | false | false | false | false | 3,156 |
56B | Vasya collects coins: he has exactly one coin for every year from 1 to _n_. Naturally, Vasya keeps all the coins in his collection in the order in which they were released. Once Vasya's younger brother made a change — he took all the coins whose release year dated from _l_ to _r_ inclusively and put them in the reverse... | 1,300 | false | false | true | false | false | false | false | false | false | false | 9,694 |
67D | Professor Phunsuk Wangdu has performed some experiments on rays. The setup for _n_ rays is as follows. There is a rectangular box having exactly _n_ holes on the opposite faces. All rays enter from the holes of the first side and exit from the holes of the other side of the box. Exactly one ray can enter or exit from e... | 1,900 | false | false | false | true | true | false | false | true | false | false | 9,633 |
1497C2 | Problem - 1497C2 - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you -... | 1,600 | true | false | false | false | false | true | false | false | false | false | 3,185 |
1204C | The main characters have been omitted to be short. You are given a directed unweighted graph without loops with $$$n$$$ vertexes and a path in it (that path is not necessary simple) given by a sequence $$$p_1, p_2, ldots, p_m$$$ of $$$m$$$ vertexes; for each $$$1 leq i < m$$$ there is an arc from $$$p_i$$$ to $$$p_{i+1... | 1,700 | false | true | false | true | false | false | false | false | false | true | 4,673 |
975B | Mancala is a game famous in the Middle East. It is played on a board that consists of 14 holes. Initially, each hole has $$$a_i$$$ stones. When a player makes a move, he chooses a hole which contains a positive number of stones. He takes all the stones inside it and then redistributes these stones one by one in the nex... | 1,100 | false | false | true | false | false | false | true | false | false | false | 5,834 |
1849B | Monocarp is playing yet another computer game. And yet again, his character is killing some monsters. There are $$$n$$$ monsters, numbered from $$$1$$$ to $$$n$$$, and the $$$i$$$-th of them has $$$a_i$$$ health points initially. Monocarp's character has an ability that deals $$$k$$$ damage to the monster with the high... | 1,000 | true | true | false | false | false | false | false | false | true | false | 1,187 |
1031C | In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely. Lesha knows that today he can study for at most $$$a$$$ hours, and he will have $$$b$$$ hours to st... | 1,600 | false | true | false | false | false | false | false | false | false | false | 5,546 |
546B | Problem - 546B - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - s... | 1,200 | false | true | true | false | false | false | true | false | true | false | 7,656 |
1666L | Leslie and Leon entered a labyrinth. The labyrinth consists of $$$n$$$ halls and $$$m$$$ one-way passages betweenxa0them. The halls are numbered from $$$1$$$ to $$$n$$$. Leslie and Leon start their journey in the hall $$$s$$$. Right away, they quarrel and decide to explore thexa0labyrinth separately. However, they want... | 1,800 | false | false | false | false | false | false | false | false | false | true | 2,274 |
1657B | You are given four integers $$$n$$$, $$$B$$$, $$$x$$$ and $$$y$$$. You should build a sequence $$$a_0, a_1, a_2, dots, a_n$$$ where $$$a_0 = 0$$$ and for each $$$i ge 1$$$ you can choose: either $$$a_i = a_{i - 1} + x$$$ or $$$a_i = a_{i - 1} - y$$$. Your goal is to build such a sequence $$$a$$$ that $$$a_i le B$$$ f... | 800 | false | true | false | false | false | false | false | false | false | false | 2,344 |
1819F | You have long dreamed of working in a large IT company and finally got a job there. You have studied all existing modern technologies for a long time and are ready to apply all your knowledge in practice. But then you sit down at your desk and see a sheet of paper with the company's motto printed in large letters: abcd... | 3,500 | false | false | false | true | true | false | false | false | false | false | 1,360 |
1872G | Given an array $$$a$$$ of $$$n$$$ positive integers. You need to perform the following operation exactly once: Choose $$$2$$$ integers $$$l$$$ and $$$r$$$ ($$$1 le l le r le n$$$) and replace the subarray $$$a[l ldots r]$$$ with the single element: the product of all elements in the subarray $$$(a_l cdot ldots cdot a_... | 2,000 | true | true | false | false | false | false | true | false | false | false | 1,045 |
761D | Dasha logged into the system and began to solve problems. One of them is as follows: Given two sequences _a_ and _b_ of length _n_ each you need to write a sequence _c_ of length _n_, the _i_-th element of which is calculated as follows: _c__i_u2009=u2009_b__i_u2009-u2009_a__i_. About sequences _a_ and _b_ we know that... | 1,700 | false | true | false | false | false | true | true | true | true | false | 6,746 |
1169B | Toad Ivan has $$$m$$$ pairs of integers, each integer is between $$$1$$$ and $$$n$$$, inclusive. The pairs are $$$(a_1, b_1), (a_2, b_2), ldots, (a_m, b_m)$$$. He asks you to check if there exist two integers $$$x$$$ and $$$y$$$ ($$$1 leq x < y leq n$$$) such that in each given pair at least one integer is equal to $$$... | 1,500 | false | false | true | false | false | false | false | false | false | true | 4,870 |
820A | Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had _c_ pages. At first day Mister B read _v_0 pages, but after that he started to speed up. Every day, starting from the second, he read _a_ pages more than on the previous day (at first day he read _v_0 pages, at s... | 900 | false | false | true | false | false | false | false | false | false | false | 6,475 |
1592C | Bakry faced a problem, but since he's lazy to solve it, he asks for your help. You are given a tree of $$$n$$$ nodes, the $$$i$$$-th node has value $$$a_i$$$ assigned to it for each $$$i$$$ from $$$1$$$ to $$$n$$$. As a reminder, a tree on $$$n$$$ nodes is a connected graph with $$$n-1$$$ edges. You want to delete at l... | 1,700 | false | false | false | true | false | true | false | false | false | true | 2,691 |
887B | Absent-minded Masha got set of _n_ cubes for her birthday. At each of 6 faces of each cube, there is exactly one digit from 0 to 9. Masha became interested what is the largest natural _x_ such she can make using her new cubes all integers from 1 to _x_. To make a number Masha can rotate her cubes and put them in a row.... | 1,300 | false | false | true | false | false | false | true | false | false | false | 6,201 |
1438E | Yurii is sure he can do everything. Can he solve this task, though? He has an array $$$a$$$ consisting of $$$n$$$ positive integers. Let's call a subarray $$$a elements from the beginning and several (possibly, zero or all) elements from the end. Input The first line contains a single integer $$$n$$$ ($$$3 leq n leq 2c... | 2,500 | false | false | false | false | false | true | true | true | false | false | 3,474 |
1873A | There are three cards with letters $$$ exttt{a}$$$, $$$ exttt{b}$$$, $$$ exttt{c}$$$ placed in a row in some order. You can do the following operation at most once: Pick two cards, and swap them. Is it possible that the row becomes $$$ exttt{abc}$$$ after the operation? Output "YES" if it is possible, and "NO" otherwi... | 800 | false | false | true | false | false | false | true | false | false | false | 1,044 |
237D | You've got a undirected tree _s_, consisting of _n_ nodes. Your task is to build an optimal T-decomposition for it. Let's define a T-decomposition as follows. Let's denote the set of all nodes _s_ as _v_. Let's consider an undirected tree _t_, whose nodes are some non-empty subsets of _v_, we'll call them _x__i_ . The ... | 2,000 | false | true | false | false | false | false | false | false | false | true | 8,886 |
1218F | Alan decided to get in shape for the summer, so he created a precise workout plan to follow. His plan is to go to a different gym every day during the next N days and lift $$$X[i]$$$ grams on day $$$i$$$. In order to improve his workout performance at the gym, he can buy exactly one pre-workout drink at the gym he is c... | 1,500 | false | true | false | false | true | false | false | false | false | false | 4,579 |
730J | Nick has _n_ bottles of soda left after his birthday. Each bottle is described by two values: remaining amount of soda _a__i_ and bottle volume _b__i_ (_a__i_u2009≤u2009_b__i_). Nick has decided to pour all remaining soda into minimal number of bottles, moreover he has to do it as soon as possible. Nick spends _x_ seco... | 1,900 | false | false | false | true | false | false | false | false | false | false | 6,879 |
404D | Game "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width is _n_ squares. Some of the squares contain bombs. If a square doesn't contain a bomb, then it contains a number from 0 to 2 — the total number of bombs in adjacent squares. For example, the correct field to play looks... | 1,900 | false | false | true | true | false | false | false | false | false | false | 8,207 |
476E | Problem - 476E - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - s... | 2,200 | false | false | false | true | false | false | false | false | false | false | 7,924 |
903C | Problem - 903C - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - s... | 1,200 | false | true | false | false | false | false | false | false | false | false | 6,132 |
1082C | A multi-subject competition is coming! The competition has $$$m$$$ different subjects participants can choose from. That's why Alex (the coach) should form a competition delegation among his students. He has $$$n$$$ candidates. For the $$$i$$$-th person he knows subject $$$s_i$$$ the candidate specializes in and $$$r_i... | 1,600 | false | true | false | false | false | false | false | false | true | false | 5,313 |
494E | During the last 24 hours Hamed and Malek spent all their time playing "Sharti". Now they are too exhausted to finish the last round. So they asked you for help to determine the winner of this round. "Sharti" is played on a _n_u2009×u2009_n_ board with some of cells colored white and others colored black. The rows of th... | 3,200 | false | false | false | false | true | false | false | false | false | false | 7,854 |
1819E | This is an interactive problem. As is well known, the city "E" has never had its roads repaired in its a thousand and a half years old history. And only recently the city administration repaired some of them. It is known that in total in the city "E" there are $$$n$$$ intersections and $$$m$$$ roads, which can be used ... | 3,200 | true | false | false | false | false | false | false | false | false | false | 1,361 |
843C | You are given a tree with _n_ vertices and you are allowed to perform no more than 2_n_ transformations on it. Transformation is defined by three vertices _x_,u2009_y_,u2009_y_' and consists of deleting edge (_x_,u2009_y_) and adding edge (_x_,u2009_y_'). Transformation _x_,u2009_y_,u2009_y_' could be performed if all ... | 2,600 | true | false | false | false | false | true | false | false | false | true | 6,389 |
769C | The Robot is in a rectangular maze of size _n_u2009×u2009_m_. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L"), right (the symbol "R"), up (the symbol "U") or down (the symbol "D"). The Robot can move to the cell only if it ... | 1,700 | false | true | false | false | false | false | false | false | false | true | 6,704 |
1106A | Lunar New Year is approaching, and you bought a matrix with lots of "crosses". This matrix $$$M$$$ of size $$$n imes n$$$ contains only 'X' and '.' (without quotes). The element in the $$$i$$$-th row and the $$$j$$$-th column $$$(i, j)$$$ is defined as $$$M(i, j)$$$, where $$$1 leq i, j leq n$$$. We define a cross app... | 800 | false | false | true | false | false | false | false | false | false | false | 5,175 |
937B | Problem - 937B - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - s... | 1,400 | true | false | false | false | false | false | true | false | false | false | 5,952 |
1791G1 | The only difference between the easy and hard versions are the locations you can teleport to. Consider the points $$$0, 1, dots, n$$$ on the number line. There is a teleporter located on each of the points $$$1, 2, dots, n$$$. At point $$$i$$$, you can do the following: Move left one unit: it costs $$$1$$$ coin. Move... | 1,100 | false | true | false | false | false | false | false | false | true | false | 1,529 |
454B | Problem - 454B - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - s... | 1,200 | false | false | true | false | false | false | false | false | false | false | 8,020 |
72I | Problem - 72I - Codeforces =============== xa0 → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems in... | 1,500 | false | false | true | false | false | false | false | false | false | false | 9,603 |
2026B | You are given a strip divided into cells, numbered from left to right from $$$0$$$ to $$$10^{18}$$$. Initially, all cells are white. You can perform the following operation: choose two white cells $$$i$$$ and $$$j$$$, such that $$$i e j$$$ and $$$i - j le k$$$, and paint them black. A list $$$a$$$ is given. All cells ... | 1,300 | false | true | false | false | false | true | true | true | false | false | 115 |
171D | Problem - 171D - Codeforces =============== xa0 | 1,300 | false | false | false | false | false | false | true | false | false | false | 9,183 |
1081F | This is an interactive problem. Chouti was tired of studying, so he opened the computer and started playing a puzzle game. Long long ago, the boy found a sequence $$$s_1, s_2, ldots, s_n$$$ of length $$$n$$$, kept by a tricky interactor. It consisted of $$$0$$$s and $$$1$$$s only and the number of $$$1$$$s is $$$t$$$. ... | 2,600 | false | false | true | false | false | true | false | false | false | false | 5,318 |
1701F | Problem - 1701F - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - ... | 2,500 | true | false | true | false | true | false | false | false | false | false | 2,071 |
1722E | You have $$$n$$$ rectangles, the $$$i$$$-th rectangle has height $$$h_i$$$ and width $$$w_i$$$. You are asked $$$q$$$ queries of the form $$$h_s w_s h_b w_b$$$. For each query output, the total area of rectangles you own that can fit a rectangle of height $$$h_s$$$ and width $$$w_s$$$ while also fitting in a rectang... | 1,600 | false | false | true | true | true | false | true | false | false | false | 1,949 |
1682F | You are given two integer arrays $$$a$$$ and $$$b$$$ ($$$b_i eq 0$$$ and $$$b_i leq 10^9$$$). Array $$$a$$$ is sorted in non-decreasing order. The cost of a subarray $$$a$$$ xa0— length of arrays $$$a$$$, $$$b$$$ and the number of queries. The next line contains $$$n$$$ integers $$$a_1,a_2 ldots a_n$$$ ($$$0 leq a_1 l... | 2,700 | false | true | false | false | true | false | false | false | true | true | 2,174 |
1132E | Problem - 1132E - Codeforces =============== xa0 ]( --- Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you -... | 2,300 | false | true | false | true | false | false | false | false | false | false | 5,057 |
1325F | It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either. Given a connected graph with $$$n$$$ vertices, you can choose to either: find an independent set that has exactly $$$lceilsqrt{n} ceil$$$ vertices... | 2,500 | false | true | false | false | false | true | false | false | false | true | 4,088 |
260B | A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is a string that only consists of digits and characters "-". We'll say that some date is mentioned in the Prophesy if there is a substring in the Prophesy that is the date's record in the format "dd-mm-yyyy". We'll say that... | 1,600 | false | false | true | false | false | false | true | false | false | false | 8,794 |
1369E | # DeadLee Input file: standard input Output file: standard output Time limit: 2 seconds Memory limit: 256 megabytes Lee bought some food for dinner time, but Lee’s friends eat dinner in a deadly way. Lee is so scared, he doesn’t want to die, at least not before seeing Online IOI 2020. . . There are n different typ... | 2,400 | false | true | true | false | true | false | false | false | true | false | 3,823 |
1467D | There are $$$n$$$ cells, numbered $$$1,2,dots, n$$$ from left to right. You have to place a robot at any cell initially. The robot must make exactly $$$k$$$ moves. In one move, the robot must move one cell to the left or right, provided that it doesn't move out of bounds. In other words, if the robot was in the cell $$... | 2,200 | true | false | false | true | false | false | false | false | false | false | 3,354 |
543E | Please note that the memory limit differs from the standard. You really love to listen to music. During the each of next _s_ days you will listen to exactly _m_ songs from the playlist that consists of exactly _n_ songs. Let's number the songs from the playlist with numbers from 1 to _n_, inclusive. The quality of song... | 3,200 | false | false | false | false | true | true | false | false | false | false | 7,665 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7