|
|
6628 |
P723F
st-Spanning Tree
|
0 / 0 |
8 |
|
|
6587 |
P731C
Socks
|
0 / 0 |
5 |
|
|
6572 |
P733F
Drivers Dissatisfaction
|
0 / 0 |
8 |
|
|
6548 |
P741B
Arpa's weak amphitheater and Mehrdad's valuable Hoses
|
0 / 0 |
5 |
|
|
6499 |
P750H
New Year and Snowy Grid
|
0 / 0 |
10 |
|
|
6488 |
P755C
PolandBall and Forest
|
0 / 0 |
4 |
|
|
6450 |
P763A
Timofey and a tree
|
0 / 0 |
5 |
|
|
6446 |
P763E
Timofey and our friends animals
|
0 / 0 |
10 |
|
|
6440 |
P765D
Artsem and Saunders
|
0 / 0 |
5 |
|
|
6433 |
P766D
Mahmoud and a Dictionary
|
0 / 0 |
7 |
|
|
6411 |
P771A
Bear and Friendship Condition
|
0 / 0 |
5 |
|
|
6372 |
P776D
The Door Problem
|
0 / 0 |
7 |
|
|
6350 |
P778C
Peterson Polyglot
|
0 / 0 |
9 |
|
|
6306 |
P788B
Weird journey
|
0 / 0 |
7 |
|
|
6197 |
P811E
Vladik and Entertaining Flags
|
0 / 0 |
10 |
|
|
6176 |
P813F
Bipartite Checking
|
0 / 0 |
9 |
|
|
6144 |
P817D
Imbalanced Array
|
0 / 0 |
6 |
|
|
6002 |
P843A
Sorting by Subsequences
|
0 / 0 |
4 |
|
|
5913 |
P859E
Desk Disorder
|
0 / 0 |
7 |
|
|
5866 |
P870E
Points, Lines and Ready-made Titles
|
0 / 0 |
8 |
|
|
5858 |
P873F
Forbidden Indices
|
0 / 0 |
9 |
|
|
5856 |
P875B
Sorting the Coins
|
0 / 0 |
5 |
|
|
5852 |
P875F
Royal Questions
|
0 / 0 |
9 |
|
|
5819 |
P884E
Binary Matrix
|
0 / 0 |
9 |
|
|
5815 |
P886C
Petya and Catacombs
|
0 / 0 |
4 |
|
|
5795 |
P891C
Envy
|
0 / 0 |
8 |
|
|
5770 |
P896E
Welcome home, Chtholly
|
4 / 19 |
10 |
|
|
5757 |
P899E
Segments Removal
|
0 / 0 |
7 |
|
|
5748 |
P901C
Bipartite Segments
|
0 / 0 |
8 |
|
|
5744 |
P902B
Coloring a Tree
|
0 / 0 |
4 |
|
|
5679 |
P915F
Imbalance Value of a Tree
|
0 / 0 |
9 |
|
|
5655 |
P920E
Connected Components?
|
0 / 0 |
7 |
|
|
5654 |
P920F
SUM and REPLACE
|
0 / 0 |
7 |
|
|
5559 |
P938G
Shortest Path Queries
|
0 / 0 |
10 |
|
|
5555 |
P939D
Love Rescue
|
0 / 0 |
5 |
|
|
5490 |
P959B
Mahmoud and Ehab and the message
|
0 / 0 |
4 |
|
|
5464 |
P962G
Visible Black Areas
|
0 / 0 |
10 |
|
|
5434 |
P977E
Cyclic Components
|
0 / 0 |
5 |
|
|
5422 |
P979D
Kuro and GCD and XOR and SUM
|
0 / 0 |
8 |
|
|
5403 |
P982D
Shark
|
0 / 0 |
6 |
|
|
5384 |
P986C
AND Graph
|
0 / 0 |
9 |
|
|
5360 |
P990G
GCD Counting
|
0 / 0 |
9 |
|
|
5251 |
P1009F
Dominant Indices
|
0 / 0 |
8 |
|
|
5240 |
P1012B
Chemical table
|
0 / 0 |
6 |
|
|
5237 |
P1012E
Cycle sort
|
0 / 0 |
10 |
|
|
5199 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
|
5185 |
P1027F
Session in BSU
|
0 / 0 |
9 |
|
|
5114 |
P1039C
Network Safety
|
0 / 0 |
8 |
|
|
5098 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
5087 |
P1044D
Deduction Queries
|
0 / 0 |
9 |
|
|
5063 |
P1051G
Distinctification
|
0 / 0 |
10 |
|
|
5052 |
P1055B
Alice and Hairdresser
|
0 / 0 |
4 |
|
|
4934 |
P1081D
Maximum Distance
|
0 / 0 |
6 |
|
|
4846 |
P1095F
Make It Connected
|
0 / 0 |
6 |
|
|
4777 |
P1107G
Vasya and Maximum Profit
|
2 / 7 |
9 |
|
|
4770 |
P1108F
MST Unification
|
0 / 0 |
7 |
|
|
4697 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
4683 |
P1130C
Connect
|
0 / 0 |
4 |
|
|
4679 |
P1131D
Gourmet choice
|
0 / 0 |
7 |
|
|
4677 |
P1131F
Asya And Kittens
|
0 / 0 |
5 |
|
|
4662 |
P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
4646 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
4637 |
P1140F
Extending Set of Points
|
0 / 0 |
10 |
|
|
4541 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
4540 |
P1156E
Special Segments of Permutation
|
0 / 0 |
8 |
|
|
4498 |
P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
4495 |
P1167C
News Distribution
|
0 / 0 |
4 |
|
|
4448 |
P1176E
Cover it!
|
0 / 0 |
5 |
|
|
4395 |
P1184E3
Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
|
4257 |
P1209D
Cow and Snacks
|
0 / 0 |
5 |
|
|
4253 |
P1209G1
Into Blocks (easy version)
|
0 / 0 |
7 |
|
|
4227 |
P1213F
Unstable String Sort
|
0 / 0 |
7 |
|
|
4226 |
P1213G
Path Queries
|
0 / 0 |
6 |
|
|
4199 |
P1217F
Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
4183 |
P1220E
Tourism
|
0 / 0 |
8 |
|
|
4128 |
P1236E
Alice and the Unfair Game
|
0 / 0 |
9 |
|
|
4102 |
P1242B
0-1 MST
|
0 / 0 |
6 |
|
|
4085 |
P1245D
Shichikuji and Power Grid
|
1 / 1 |
6 |
|
|
4077 |
P1249B1
Books Exchange (easy version)
|
0 / 0 |
3 |
|
|
4076 |
P1249B2
Books Exchange (hard version)
|
0 / 0 |
4 |
|
|
4013 |
P1253D
Harmonious Graph
|
0 / 0 |
5 |
|
|
4010 |
P1253F
Cheap Robot
|
0 / 0 |
9 |
|
|
3997 |
P1254E
Send Tree to Charlie
|
0 / 0 |
10 |
|
|
3944 |
P1263D
Secret Passwords
|
0 / 0 |
5 |
|
|
3822 |
P1276B
Two Fairs
|
0 / 0 |
6 |
|
|
3800 |
P1278D
Segment Tree
|
0 / 0 |
7 |
|
|
3696 |
P1290C
Prefix Enlightenment
|
0 / 0 |
9 |
|
|
3682 |
P1292A
NEKO's Maze Game
|
0 / 0 |
4 |
|
|
3592 |
P1303F
Number of Components
|
0 / 0 |
10 |
|
|
3577 |
P1305G
Kuroni and Antihype
|
0 / 0 |
10 |
|
|
3570 |
P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
|
3397 |
P1332C
K-Complete Word
|
0 / 0 |
5 |
|
|
3362 |
P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
|
3324 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
3213 |
P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
3192 |
P1365D
Solve The Maze
|
0 / 0 |
5 |
|
|
3156 |
P1370D
Odd-Even Subsequence
|
0 / 0 |
7 |
|
|
3105 |
P1380E
Merging Towers
|
0 / 0 |
8 |
|
|
3094 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
3079 |
P1385G
Columns Swaps
|
0 / 0 |
8 |
