|
|
4935 |
P1081C Colorful Bricks
|
0 / 0 |
5 |
|
|
4925 |
P1082E Increasing Frequency
|
0 / 0 |
7 |
|
|
4924 |
P1082F Speed Dial
|
0 / 0 |
10 |
|
|
4922 |
P1083A The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
4918 |
P1083E The Fair Nut and Rectangles
|
0 / 0 |
9 |
|
|
4914 |
P1084C The Fair Nut and String
|
0 / 0 |
5 |
|
|
4907 |
P1085G Beautiful Matrix
|
0 / 0 |
10 |
|
|
4901 |
P1088E Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
4899 |
P1089A Alice the Fan
|
0 / 0 |
8 |
|
|
4870 |
P1091D New Year and the Permutation Concatenation
|
0 / 0 |
5 |
|
|
4859 |
P1092F Tree with Maximum Cost
|
1 / 4 |
6 |
|
|
4853 |
P1093F Vasya and Array
|
0 / 0 |
9 |
|
|
4842 |
P1096D Easy Problem
|
0 / 0 |
6 |
|
|
4841 |
P1096E The Top Scorer
|
0 / 0 |
9 |
|
|
4840 |
P1096F Inversion Expectation
|
0 / 0 |
8 |
|
|
4839 |
P1096G Lucky Tickets
|
1 / 1 |
9 |
|
|
4837 |
P1097B Petr and a Combination Lock
|
0 / 0 |
4 |
|
|
4835 |
P1097D Makoto and a Blackboard
|
0 / 0 |
8 |
|
|
4832 |
P1097G Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
4831 |
P1097H Mateusz and an Infinite Sequence
|
0 / 0 |
10 |
|
|
4821 |
P1099F Cookies
|
0 / 0 |
9 |
|
|
4811 |
P1101D GCD Counting
|
0 / 0 |
7 |
|
|
4809 |
P1101F Trucks and Cities
|
0 / 0 |
9 |
|
|
4802 |
P1102F Elongated Matrix
|
0 / 0 |
7 |
|
|
4798 |
P1103D Professional layer
|
0 / 0 |
10 |
|
|
4792 |
P1105C Ayoub and Lost Array
|
1 / 1 |
5 |
|
|
4790 |
P1105E Helping Hiasat
|
0 / 0 |
8 |
|
|
4785 |
P1106E Lunar New Year and Red Envelopes
|
0 / 0 |
7 |
|
|
4780 |
P1107D Compression
|
7 / 51 |
6 |
|
|
4779 |
P1107E Vasya and Binary String
|
2 / 5 |
9 |
|
|
4778 |
P1107F Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
4777 |
P1107G Vasya and Maximum Profit
|
2 / 7 |
9 |
|
|
4773 |
P1108D Diverse Garland
|
0 / 0 |
4 |
|
|
4769 |
P1109A Sasha and a Bit of Relax
|
0 / 0 |
5 |
|
|
4766 |
P1109D Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
|
4760 |
P1110D Jongmah
|
0 / 0 |
8 |
|
|
4756 |
P1110H Modest Substrings
|
0 / 0 |
10 |
|
|
4752 |
P1111D Destroy the Colony
|
0 / 0 |
10 |
|
|
4751 |
P1111E Tree
|
0 / 0 |
9 |
|
|
4750 |
P1113A Sasha and His Trip
|
0 / 0 |
3 |
|
|
4745 |
P1114D Flood Fill
|
0 / 0 |
6 |
|
|
4720 |
P1117D Magic Gems
|
0 / 0 |
7 |
|
|
4718 |
P1117F Crisp String
|
0 / 0 |
9 |
|
|
4709 |
P1118F2 Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
|
4704 |
P1119E Pavel and Triangles
|
0 / 0 |
6 |
|
|
4703 |
P1119F Niyaz and Small Degrees
|
0 / 0 |
10 |
|
|
4698 |
P1120C Compress String
|
0 / 0 |
7 |
|
|
4697 |
P1120D Power Tree
|
0 / 0 |
9 |
|
|
4695 |
P1120F Secret Letters
|
0 / 0 |
10 |
|
|
4688 |
P1129C Morse Code
|
0 / 0 |
9 |
|
|
4687 |
P1129D Isolation
|
0 / 0 |
10 |
|
|
4679 |
P1131D Gourmet choice
|
0 / 0 |
7 |
|
|
4678 |
P1131E String Multiplication
|
0 / 0 |
8 |
|
|
4676 |
P1131G Most Dangerous Shark
|
0 / 0 |
10 |
|
|
4671 |
P1132E Knapsack
|
0 / 0 |
8 |
|
|
4670 |
P1132F Clear the String
|
0 / 0 |
7 |
|
|
4669 |
P1132G Greedy Subsequences
|
0 / 0 |
9 |
|
|
4664 |
P1133E K Balanced Teams
|
0 / 0 |
6 |
|
|
4654 |
P1137C Museums Tour
|
0 / 0 |
9 |
|
|
4645 |
P1139D Steps to One
|
0 / 0 |
8 |
|
|
4639 |
P1140D Minimum Triangulation
|
0 / 0 |
4 |
|
|
4638 |
P1140E Palindrome-less Arrays
|
0 / 0 |
8 |
|
|
4626 |
P1142B Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
4624 |
P1142D Foreigner
|
0 / 0 |
10 |
|
|
4613 |
P1144G Two Merged Sequences
|
0 / 0 |
9 |
|
|
4600 |
P1146F Leaf Partition
|
0 / 0 |
9 |
|
|
4599 |
P1146G Zoning Restrictions
|
0 / 0 |
10 |
|
|
4598 |
P1146H Satanic Panic
|
0 / 0 |
10 |
|
|
4582 |
P1149B Three Religions
|
0 / 0 |
8 |
|
|
4580 |
P1149D Abandoning Roads
|
0 / 0 |
10 |
|
|
4575 |
P1151B Dima and a Bad XOR
|
0 / 0 |
5 |
|
|
4572 |
P1151E Number of Components
|
0 / 0 |
7 |
|
|
4571 |
P1151F Sonya and Informatics
|
0 / 0 |
8 |
|
|
4567 |
P1152D Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
4565 |
P1152F1 Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
4564 |
P1152F2 Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
4560 |
P1153D Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
4558 |
P1153F Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
4552 |
P1154F Shovels Shop
|
0 / 0 |
7 |
|
|
4547 |
P1155D Beautiful Array
|
0 / 0 |
6 |
|
|
4545 |
P1155F Delivery Oligopoly
|
0 / 0 |
10 |
|
|
4541 |
P1156D 0-1-Tree
|
0 / 0 |
8 |
|
|
4539 |
P1156F Card Bag
|
0 / 0 |
8 |
|
|
4531 |
P1157F Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
4524 |
P1158F Density of subarrays
|
0 / 0 |
10 |
|
|
4513 |
P1163D Mysterious Code
|
0 / 0 |
7 |
|
|
4488 |
P1168C And Reachability
|
0 / 0 |
8 |
|
|
4487 |
P1168D Anagram Paths
|
0 / 0 |
10 |
|
|
4475 |
P1170I Good Subsets
|
0 / 0 |
(None) |
|
|
4473 |
P1172B Nauuo and Circle
|
0 / 0 |
6 |
|
|
4472 |
P1172C1 Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
4471 |
P1172C2 Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
4461 |
P1174E Ehab and the Expected GCD Problem
|
0 / 0 |
9 |
|
|
4455 |
P1175E Minimal Segment Cover
|
4 / 11 |
8 |
|
|
4453 |
P1175G Yet Another Partiton Problem
|
0 / 0 |
10 |
|
|
4450 |
P1176C Lose it!
|
0 / 0 |
4 |
|
|
4447 |
P1176F Destroy it!
|
0 / 0 |
7 |
|
|
4443 |
P1178B WOW Factor
|
0 / 0 |
4 |
|
|
4439 |
P1178F1 Short Colorful Strip
|
1 / 1 |
8 |
|
|
4438 |
P1178F2 Long Colorful Strip
|
0 / 0 |
10 |
