|
|
251 |
P1792E
Divisors and Table
|
0 / 0 |
9 |
|
|
249 |
P1792F1
Graph Coloring (easy version)
|
0 / 0 |
10 |
|
|
247 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
10 |
|
|
248 |
P1793A
Yet Another Promotion
|
0 / 0 |
3 |
|
|
245 |
P1793B
Fedya and Array
|
0 / 0 |
3 |
|
|
244 |
P1793C
Dora and Search
|
0 / 0 |
4 |
|
|
242 |
P1793D
Moscow Gorillas
|
0 / 0 |
6 |
|
|
241 |
P1793E
Velepin and Marketing
|
0 / 0 |
10 |
|
|
239 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
237 |
P1794A
Prefix and Suffix Array
|
0 / 0 |
3 |
|
|
236 |
P1794B
Not Dividing
|
0 / 0 |
3 |
|
|
234 |
P1794C
Scoring Subsequences
|
0 / 0 |
4 |
|
|
233 |
P1794D
Counting Factorizations
|
0 / 0 |
6 |
|
|
231 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
9 |
|
|
230 |
P1795A
Two Towers
|
1 / 1 |
3 |
|
|
229 |
P1795B
Ideal Point
|
1 / 1 |
3 |
|
|
227 |
P1795C
Tea Tasting
|
0 / 0 |
5 |
|
|
225 |
P1795D
Triangle Coloring
|
1 / 1 |
5 |
|
|
224 |
P1795E
Explosions?
|
0 / 0 |
8 |
|
|
222 |
P1795F
Blocking Chips
|
0 / 0 |
9 |
|
|
221 |
P1795G
Removal Sequences
|
0 / 0 |
10 |
|
|
219 |
P1796A
Typical Interview Problem
|
0 / 13 |
3 |
|
|
218 |
P1796B
Asterisk-Minor Template
|
0 / 0 |
3 |
|
|
216 |
P1796C
Maximum Set
|
0 / 1 |
5 |
|
|
215 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
213 |
P1796E
Colored Subgraphs
|
0 / 0 |
9 |
|
|
212 |
P1796F
Strange Triples
|
0 / 0 |
10 |
|
|
211 |
P1797A
Li Hua and Maze
|
0 / 0 |
3 |
|
|
209 |
P1797B
Li Hua and Pattern
|
0 / 0 |
3 |
|
|
207 |
P1797C
Li Hua and Chess
|
0 / 0 |
5 |
|
|
206 |
P1797D
Li Hua and Tree
|
0 / 0 |
6 |
|
|
204 |
P1797E
Li Hua and Array
|
0 / 0 |
8 |
|
|
203 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
201 |
P1798A
Showstopper
|
1 / 1 |
3 |
|
|
199 |
P1798B
Three Sevens
|
0 / 0 |
3 |
|
|
198 |
P1798C
Candy Store
|
1 / 1 |
5 |
|
|
196 |
P1798D
Shocking Arrangement
|
0 / 0 |
5 |
|
|
195 |
P1798E
Multitest Generator
|
0 / 0 |
8 |
|
|
193 |
P1798F
Gifts from Grandfather Ahmed
|
0 / 0 |
9 |
|
|
192 |
P1799A
Recent Actions
|
0 / 0 |
3 |
|
|
190 |
P1799B
Equalize by Divide
|
0 / 0 |
4 |
|
|
189 |
P1799C
Double Lexicographically Minimum
|
0 / 0 |
5 |
|
|
187 |
P1799D1
Hot Start Up (easy version)
|
0 / 0 |
6 |
|
|
186 |
P1799D2
Hot Start Up (hard version)
|
0 / 0 |
7 |
|
|
184 |
P1799E
City Union
|
0 / 0 |
8 |
|
|
183 |
P1799F
Halve or Subtract
|
0 / 0 |
10 |
|
|
181 |
P1799G
Count Voting
|
0 / 0 |
10 |
|
|
180 |
P1799H
Tree Cutting
|
0 / 0 |
10 |
|
|
179 |
P1800A
Is It a Cat?
|
0 / 0 |
3 |
|
|
177 |
P1800B
Count the Number of Pairs
|
0 / 0 |
3 |
|
|
175 |
P1800C1
Powering the Hero (easy version)
|
0 / 0 |
3 |
|
|
174 |
P1800C2
Powering the Hero (hard version)
|
0 / 0 |
3 |
|
|
172 |
P1800D
Remove Two Letters
|
0 / 0 |
4 |
|
|
171 |
P1800E1
Unforgivable Curse (easy version)
|
0 / 0 |
4 |
|
|
169 |
P1800E2
Unforgivable Curse (hard version)
|
0 / 0 |
5 |
|
|
168 |
P1800F
Dasha and Nightmares
|
0 / 0 |
6 |
|
|
166 |
P1800G
Symmetree
|
0 / 0 |
8 |
|
|
165 |
P1801A
The Very Beautiful Blanket
|
0 / 0 |
5 |
|
|
163 |
P1801B
Buying gifts
|
0 / 0 |
6 |
|
|
162 |
P1801C
Music Festival
|
0 / 0 |
6 |
|
|
160 |
P1801D
The way home
|
0 / 0 |
7 |
|
|
159 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
157 |
P1801F
Another n-dimensional chocolate bar
|
0 / 0 |
10 |
|
|
155 |
P1801G
A task for substrings
|
0 / 0 |
10 |
|
|
154 |
P1802A
Likes
|
1 / 1 |
3 |
|
|
152 |
P1802B
Settlement of Guinea Pigs
|
1 / 1 |
3 |
|
|
151 |
P1804A
Lame King
|
0 / 0 |
3 |
|
|
149 |
P1804B
Vaccination
|
0 / 0 |
3 |
|
|
148 |
P1804C
Pull Your Luck
|
0 / 0 |
5 |
|
|
147 |
P1804D
Accommodation
|
0 / 0 |
7 |
|
|
145 |
P1804E
Routing
|
0 / 0 |
9 |
|
|
144 |
P1804F
Approximate Diameter
|
0 / 0 |
10 |
|
|
143 |
P1804G
Flow Control
|
0 / 0 |
10 |
|
|
142 |
P1804H
Code Lock
|
0 / 0 |
10 |
|
|
141 |
P1805A
We Need the Zero
|
0 / 0 |
3 |
|
|
140 |
P1805B
The String Has a Target
|
0 / 0 |
3 |
|
|
139 |
P1805C
Place for a Selfie
|
0 / 0 |
4 |
|
|
138 |
P1805D
A Wide, Wide Graph
|
0 / 0 |
6 |
|
|
137 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
|
136 |
P1805F1
Survival of the Weakest (easy version)
|
0 / 0 |
10 |
|
|
135 |
P1805F2
Survival of the Weakest (hard version)
|
0 / 0 |
10 |
|
|
134 |
P1806A
Walking Master
|
2 / 2 |
3 |
|
|
133 |
P1806B
Mex Master
|
2 / 2 |
3 |
|
|
131 |
P1806C
Sequence Master
|
1 / 1 |
5 |
|
|
130 |
P1806D
DSU Master
|
0 / 0 |
9 |
|
|
128 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
|
127 |
P1806F1
GCD Master (easy version)
|
0 / 0 |
10 |
|
|
125 |
P1806F2
GCD Master (hard version)
|
0 / 0 |
10 |
|
|
124 |
P1807A
Plus or Minus
|
0 / 0 |
3 |
|
|
123 |
P1807B
Grab the Candies
|
0 / 0 |
3 |
|
|
121 |
P1807C
Find and Replace
|
0 / 0 |
3 |
|
|
120 |
P1807D
Odd Queries
|
0 / 0 |
3 |
|
|
118 |
P1807E
Interview
|
0 / 0 |
4 |
|
|
116 |
P1807F
Bouncy Ball
|
0 / 0 |
5 |
|
|
114 |
P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
3 |
|
|
112 |
P1807G2
Subsequence Addition (Hard Version)
|
0 / 0 |
3 |
|
|
111 |
P1808A
Lucky Numbers
|
0 / 0 |
3 |
|
|
110 |
P1808B
Playing in a Casino
|
0 / 0 |
4 |
|
|
108 |
P1808C
Unlucky Numbers
|
0 / 0 |
6 |
|
|
106 |
P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
