|
|
4352 |
P1081C Colorful Bricks
|
0 / 0 |
5 |
|
|
4342 |
P1082E Increasing Frequency
|
0 / 0 |
7 |
|
|
4341 |
P1082F Speed Dial
|
0 / 0 |
10 |
|
|
4339 |
P1083A The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
4335 |
P1083E The Fair Nut and Rectangles
|
0 / 0 |
9 |
|
|
4331 |
P1084C The Fair Nut and String
|
0 / 0 |
5 |
|
|
4324 |
P1085G Beautiful Matrix
|
0 / 0 |
10 |
|
|
4318 |
P1088E Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
4316 |
P1089A Alice the Fan
|
0 / 0 |
8 |
|
|
4287 |
P1091D New Year and the Permutation Concatenation
|
0 / 0 |
5 |
|
|
4276 |
P1092F Tree with Maximum Cost
|
0 / 0 |
6 |
|
|
4270 |
P1093F Vasya and Array
|
0 / 0 |
9 |
|
|
4259 |
P1096D Easy Problem
|
0 / 0 |
6 |
|
|
4258 |
P1096E The Top Scorer
|
0 / 0 |
9 |
|
|
4257 |
P1096F Inversion Expectation
|
0 / 0 |
8 |
|
|
4256 |
P1096G Lucky Tickets
|
0 / 0 |
9 |
|
|
4254 |
P1097B Petr and a Combination Lock
|
0 / 0 |
4 |
|
|
4252 |
P1097D Makoto and a Blackboard
|
0 / 0 |
8 |
|
|
4249 |
P1097G Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
4248 |
P1097H Mateusz and an Infinite Sequence
|
0 / 0 |
10 |
|
|
4238 |
P1099F Cookies
|
0 / 0 |
9 |
|
|
4228 |
P1101D GCD Counting
|
0 / 0 |
7 |
|
|
4226 |
P1101F Trucks and Cities
|
0 / 0 |
9 |
|
|
4219 |
P1102F Elongated Matrix
|
0 / 0 |
7 |
|
|
4215 |
P1103D Professional layer
|
0 / 0 |
10 |
|
|
4209 |
P1105C Ayoub and Lost Array
|
0 / 0 |
5 |
|
|
4207 |
P1105E Helping Hiasat
|
0 / 0 |
8 |
|
|
4202 |
P1106E Lunar New Year and Red Envelopes
|
0 / 0 |
7 |
|
|
4197 |
P1107D Compression
|
0 / 0 |
6 |
|
|
4196 |
P1107E Vasya and Binary String
|
0 / 0 |
9 |
|
|
4195 |
P1107F Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
4194 |
P1107G Vasya and Maximum Profit
|
0 / 0 |
9 |
|
|
4190 |
P1108D Diverse Garland
|
0 / 0 |
4 |
|
|
4186 |
P1109A Sasha and a Bit of Relax
|
0 / 0 |
5 |
|
|
4183 |
P1109D Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
|
4177 |
P1110D Jongmah
|
0 / 0 |
8 |
|
|
4173 |
P1110H Modest Substrings
|
0 / 0 |
10 |
|
|
4169 |
P1111D Destroy the Colony
|
0 / 0 |
10 |
|
|
4168 |
P1111E Tree
|
0 / 0 |
9 |
|
|
4167 |
P1113A Sasha and His Trip
|
0 / 0 |
3 |
|
|
4162 |
P1114D Flood Fill
|
0 / 0 |
6 |
|
|
4137 |
P1117D Magic Gems
|
0 / 0 |
7 |
|
|
4135 |
P1117F Crisp String
|
0 / 0 |
9 |
|
|
4126 |
P1118F2 Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
|
4121 |
P1119E Pavel and Triangles
|
0 / 0 |
6 |
|
|
4120 |
P1119F Niyaz and Small Degrees
|
0 / 0 |
10 |
|
|
4115 |
P1120C Compress String
|
0 / 0 |
7 |
|
|
4114 |
P1120D Power Tree
|
0 / 0 |
9 |
|
|
4112 |
P1120F Secret Letters
|
0 / 0 |
10 |
|
|
4105 |
P1129C Morse Code
|
0 / 0 |
9 |
|
|
4104 |
P1129D Isolation
|
0 / 0 |
10 |
|
|
4096 |
P1131D Gourmet choice
|
0 / 0 |
7 |
|
|
4095 |
P1131E String Multiplication
|
0 / 0 |
8 |
|
|
4093 |
P1131G Most Dangerous Shark
|
0 / 0 |
10 |
|
|
4088 |
P1132E Knapsack
|
0 / 0 |
8 |
|
|
4087 |
P1132F Clear the String
|
0 / 0 |
7 |
|
|
4086 |
P1132G Greedy Subsequences
|
0 / 0 |
9 |
|
|
4081 |
P1133E K Balanced Teams
|
0 / 0 |
6 |
|
|
4071 |
P1137C Museums Tour
|
0 / 0 |
9 |
|
|
4062 |
P1139D Steps to One
|
0 / 0 |
8 |
|
|
4056 |
P1140D Minimum Triangulation
|
0 / 0 |
4 |
|
|
4055 |
P1140E Palindrome-less Arrays
|
0 / 0 |
8 |
|
|
4043 |
P1142B Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
4041 |
P1142D Foreigner
|
0 / 0 |
10 |
|
|
4030 |
P1144G Two Merged Sequences
|
0 / 0 |
9 |
|
|
4017 |
P1146F Leaf Partition
|
0 / 0 |
9 |
|
|
4016 |
P1146G Zoning Restrictions
|
0 / 0 |
10 |
|
|
4015 |
P1146H Satanic Panic
|
0 / 0 |
10 |
|
|
3999 |
P1149B Three Religions
|
0 / 0 |
8 |
|
|
3997 |
P1149D Abandoning Roads
|
0 / 0 |
10 |
|
|
3992 |
P1151B Dima and a Bad XOR
|
0 / 0 |
5 |
|
|
3989 |
P1151E Number of Components
|
0 / 0 |
7 |
|
|
3988 |
P1151F Sonya and Informatics
|
0 / 0 |
8 |
|
|
3984 |
P1152D Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
3982 |
P1152F1 Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
3981 |
P1152F2 Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
3977 |
P1153D Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
3975 |
P1153F Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
3969 |
P1154F Shovels Shop
|
0 / 0 |
7 |
|
|
3964 |
P1155D Beautiful Array
|
0 / 0 |
6 |
|
|
3962 |
P1155F Delivery Oligopoly
|
0 / 0 |
10 |
|
|
3958 |
P1156D 0-1-Tree
|
0 / 0 |
8 |
|
|
3956 |
P1156F Card Bag
|
0 / 0 |
8 |
|
|
3948 |
P1157F Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
3941 |
P1158F Density of subarrays
|
0 / 0 |
10 |
|
|
3930 |
P1163D Mysterious Code
|
0 / 0 |
7 |
|
|
3905 |
P1168C And Reachability
|
0 / 0 |
8 |
|
|
3904 |
P1168D Anagram Paths
|
0 / 0 |
10 |
|
|
3892 |
P1170I Good Subsets
|
0 / 0 |
(None) |
|
|
3890 |
P1172B Nauuo and Circle
|
0 / 0 |
6 |
|
|
3889 |
P1172C1 Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
3888 |
P1172C2 Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
3878 |
P1174E Ehab and the Expected GCD Problem
|
0 / 0 |
9 |
|
|
3872 |
P1175E Minimal Segment Cover
|
0 / 0 |
8 |
|
|
3870 |
P1175G Yet Another Partiton Problem
|
0 / 0 |
10 |
|
|
3867 |
P1176C Lose it!
|
0 / 0 |
4 |
|
|
3864 |
P1176F Destroy it!
|
0 / 0 |
7 |
|
|
3860 |
P1178B WOW Factor
|
0 / 0 |
4 |
|
|
3856 |
P1178F1 Short Colorful Strip
|
0 / 0 |
8 |
|
|
3855 |
P1178F2 Long Colorful Strip
|
0 / 0 |
10 |
