|
|
5982 |
P723F st-Spanning Tree
|
0 / 0 |
8 |
|
|
5941 |
P731C Socks
|
0 / 0 |
5 |
|
|
5926 |
P733F Drivers Dissatisfaction
|
0 / 0 |
8 |
|
|
5902 |
P741B Arpa's weak amphitheater and Mehrdad's valuable Hoses
|
0 / 0 |
5 |
|
|
5853 |
P750H New Year and Snowy Grid
|
0 / 0 |
10 |
|
|
5842 |
P755C PolandBall and Forest
|
0 / 0 |
4 |
|
|
5804 |
P763A Timofey and a tree
|
0 / 0 |
5 |
|
|
5800 |
P763E Timofey and our friends animals
|
0 / 0 |
10 |
|
|
5794 |
P765D Artsem and Saunders
|
0 / 0 |
5 |
|
|
5787 |
P766D Mahmoud and a Dictionary
|
0 / 0 |
7 |
|
|
5765 |
P771A Bear and Friendship Condition
|
0 / 0 |
5 |
|
|
5732 |
P776D The Door Problem
|
0 / 0 |
7 |
|
|
5721 |
P778C Peterson Polyglot
|
0 / 0 |
9 |
|
|
5687 |
P788B Weird journey
|
0 / 0 |
7 |
|
|
5584 |
P811E Vladik and Entertaining Flags
|
0 / 0 |
10 |
|
|
5573 |
P813F Bipartite Checking
|
0 / 0 |
9 |
|
|
5557 |
P817D Imbalanced Array
|
0 / 0 |
6 |
|
|
5458 |
P843A Sorting by Subsequences
|
0 / 0 |
4 |
|
|
5371 |
P859E Desk Disorder
|
0 / 0 |
7 |
|
|
5311 |
P870E Points, Lines and Ready-made Titles
|
0 / 0 |
8 |
|
|
5303 |
P873F Forbidden Indices
|
0 / 0 |
9 |
|
|
5301 |
P875B Sorting the Coins
|
0 / 0 |
5 |
|
|
5297 |
P875F Royal Questions
|
0 / 0 |
9 |
|
|
5264 |
P884E Binary Matrix
|
0 / 0 |
9 |
|
|
5260 |
P886C Petya and Catacombs
|
0 / 0 |
4 |
|
|
5240 |
P891C Envy
|
0 / 0 |
8 |
|
|
5215 |
P896E Welcome home, Chtholly
|
0 / 0 |
10 |
|
|
5202 |
P899E Segments Removal
|
0 / 0 |
7 |
|
|
5193 |
P901C Bipartite Segments
|
0 / 0 |
8 |
|
|
5189 |
P902B Coloring a Tree
|
0 / 0 |
4 |
|
|
5103 |
P915F Imbalance Value of a Tree
|
0 / 0 |
9 |
|
|
5079 |
P920E Connected Components?
|
0 / 0 |
7 |
|
|
5078 |
P920F SUM and REPLACE
|
0 / 0 |
7 |
|
|
4976 |
P938G Shortest Path Queries
|
0 / 0 |
10 |
|
|
4972 |
P939D Love Rescue
|
0 / 0 |
5 |
|
|
4907 |
P959B Mahmoud and Ehab and the message
|
0 / 0 |
4 |
|
|
4881 |
P962G Visible Black Areas
|
0 / 0 |
10 |
|
|
4851 |
P977E Cyclic Components
|
0 / 0 |
5 |
|
|
4839 |
P979D Kuro and GCD and XOR and SUM
|
0 / 0 |
8 |
|
|
4820 |
P982D Shark
|
0 / 0 |
6 |
|
|
4801 |
P986C AND Graph
|
0 / 0 |
9 |
|
|
4777 |
P990G GCD Counting
|
0 / 0 |
9 |
|
|
4668 |
P1009F Dominant Indices
|
0 / 0 |
8 |
|
|
4657 |
P1012B Chemical table
|
0 / 0 |
6 |
|
|
4654 |
P1012E Cycle sort
|
0 / 0 |
10 |
|
|
4616 |
P1023F Mobile Phone Network
|
0 / 0 |
10 |
|
|
4602 |
P1027F Session in BSU
|
0 / 0 |
9 |
|
|
4531 |
P1039C Network Safety
|
0 / 0 |
8 |
|
|
4515 |
P1042F Leaf Sets
|
0 / 0 |
9 |
|
|
4504 |
P1044D Deduction Queries
|
0 / 0 |
9 |
|
|
4480 |
P1051G Distinctification
|
0 / 0 |
10 |
|
|
4469 |
P1055B Alice and Hairdresser
|
0 / 0 |
4 |
|
|
4351 |
P1081D Maximum Distance
|
0 / 0 |
6 |
|
|
4263 |
P1095F Make It Connected
|
0 / 0 |
6 |
|
|
4194 |
P1107G Vasya and Maximum Profit
|
0 / 0 |
9 |
|
|
4187 |
P1108F MST Unification
|
0 / 0 |
7 |
|
|
4114 |
P1120D Power Tree
|
0 / 0 |
9 |
|
|
4100 |
P1130C Connect
|
0 / 0 |
4 |
|
|
4096 |
P1131D Gourmet choice
|
0 / 0 |
7 |
|
|
4094 |
P1131F Asya And Kittens
|
0 / 0 |
5 |
|
|
4079 |
P1133F2 Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
4063 |
P1139C Edgy Trees
|
0 / 0 |
5 |
|
|
4054 |
P1140F Extending Set of Points
|
0 / 0 |
10 |
|
|
3958 |
P1156D 0-1-Tree
|
0 / 0 |
8 |
|
|
3957 |
P1156E Special Segments of Permutation
|
0 / 0 |
8 |
|
|
3915 |
P1166F Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
3912 |
P1167C News Distribution
|
0 / 0 |
4 |
|
|
3865 |
P1176E Cover it!
|
0 / 0 |
5 |
|
|
3812 |
P1184E3 Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
|
3674 |
P1209D Cow and Snacks
|
0 / 0 |
5 |
|
|
3670 |
P1209G1 Into Blocks (easy version)
|
0 / 0 |
7 |
|
|
3644 |
P1213F Unstable String Sort
|
0 / 0 |
7 |
|
|
3643 |
P1213G Path Queries
|
0 / 0 |
6 |
|
|
3616 |
P1217F Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
3600 |
P1220E Tourism
|
0 / 0 |
8 |
|
|
3545 |
P1236E Alice and the Unfair Game
|
0 / 0 |
9 |
|
|
3519 |
P1242B 0-1 MST
|
0 / 0 |
6 |
|
|
3502 |
P1245D Shichikuji and Power Grid
|
0 / 0 |
6 |
|
|
3494 |
P1249B1 Books Exchange (easy version)
|
0 / 0 |
3 |
|
|
3493 |
P1249B2 Books Exchange (hard version)
|
0 / 0 |
4 |
|
|
3450 |
P1253D Harmonious Graph
|
0 / 0 |
5 |
|
|
3448 |
P1253F Cheap Robot
|
0 / 0 |
9 |
|
|
3442 |
P1254E Send Tree to Charlie
|
0 / 0 |
10 |
|
|
3415 |
P1263D Secret Passwords
|
0 / 0 |
5 |
|
|
3353 |
P1276B Two Fairs
|
0 / 0 |
6 |
|
|
3342 |
P1278D Segment Tree
|
0 / 0 |
7 |
|
|
3283 |
P1290C Prefix Enlightenment
|
0 / 0 |
9 |
|
|
3276 |
P1292A NEKO's Maze Game
|
0 / 0 |
4 |
|
|
3212 |
P1303F Number of Components
|
0 / 0 |
10 |
|
|
3197 |
P1305G Kuroni and Antihype
|
0 / 0 |
10 |
|
|
3190 |
P1307F Cow and Vacation
|
0 / 0 |
10 |
|
|
3087 |
P1332C K-Complete Word
|
0 / 0 |
5 |
|
|
3063 |
P1335F Robots on a Grid
|
0 / 0 |
8 |
|
|
3025 |
P1344B Monopole Magnets
|
0 / 0 |
7 |
|
|
2914 |
P1361C Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
2893 |
P1365D Solve The Maze
|
0 / 0 |
5 |
|
|
2857 |
P1370D Odd-Even Subsequence
|
0 / 0 |
7 |
|
|
2806 |
P1380E Merging Towers
|
0 / 0 |
8 |
|
|
2795 |
P1383A String Transformation 1
|
0 / 0 |
5 |
|
|
2780 |
P1385G Columns Swaps
|
0 / 0 |
8 |
