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