|
|
3531 |
P1081C
Colorful Bricks
|
0 / 0 |
5 |
|
|
3521 |
P1082E
Increasing Frequency
|
0 / 0 |
7 |
|
|
3520 |
P1082F
Speed Dial
|
0 / 0 |
10 |
|
|
3518 |
P1083A
The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
3514 |
P1083E
The Fair Nut and Rectangles
|
0 / 0 |
9 |
|
|
3510 |
P1084C
The Fair Nut and String
|
0 / 0 |
5 |
|
|
3503 |
P1085G
Beautiful Matrix
|
0 / 0 |
10 |
|
|
3497 |
P1088E
Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
3495 |
P1089A
Alice the Fan
|
0 / 0 |
8 |
|
|
3466 |
P1091D
New Year and the Permutation Concatenation
|
0 / 0 |
5 |
|
|
3455 |
P1092F
Tree with Maximum Cost
|
0 / 0 |
6 |
|
|
3449 |
P1093F
Vasya and Array
|
0 / 0 |
9 |
|
|
3438 |
P1096D
Easy Problem
|
0 / 0 |
6 |
|
|
3437 |
P1096E
The Top Scorer
|
0 / 0 |
9 |
|
|
3436 |
P1096F
Inversion Expectation
|
0 / 0 |
8 |
|
|
3435 |
P1096G
Lucky Tickets
|
0 / 0 |
9 |
|
|
3433 |
P1097B
Petr and a Combination Lock
|
0 / 0 |
4 |
|
|
3431 |
P1097D
Makoto and a Blackboard
|
0 / 0 |
8 |
|
|
3428 |
P1097G
Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
3427 |
P1097H
Mateusz and an Infinite Sequence
|
0 / 0 |
10 |
|
|
3417 |
P1099F
Cookies
|
0 / 0 |
9 |
|
|
3407 |
P1101D
GCD Counting
|
0 / 0 |
7 |
|
|
3405 |
P1101F
Trucks and Cities
|
0 / 0 |
9 |
|
|
3398 |
P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
|
3394 |
P1103D
Professional layer
|
0 / 0 |
10 |
|
|
3388 |
P1105C
Ayoub and Lost Array
|
0 / 0 |
5 |
|
|
3386 |
P1105E
Helping Hiasat
|
0 / 0 |
8 |
|
|
3381 |
P1106E
Lunar New Year and Red Envelopes
|
0 / 0 |
7 |
|
|
3376 |
P1107D
Compression
|
0 / 0 |
6 |
|
|
3375 |
P1107E
Vasya and Binary String
|
0 / 0 |
9 |
|
|
3374 |
P1107F
Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
3373 |
P1107G
Vasya and Maximum Profit
|
0 / 0 |
9 |
|
|
3369 |
P1108D
Diverse Garland
|
0 / 0 |
4 |
|
|
3365 |
P1109A
Sasha and a Bit of Relax
|
0 / 0 |
5 |
|
|
3362 |
P1109D
Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
|
3356 |
P1110D
Jongmah
|
0 / 0 |
8 |
|
|
3352 |
P1110H
Modest Substrings
|
0 / 0 |
10 |
|
|
3348 |
P1111D
Destroy the Colony
|
0 / 0 |
10 |
|
|
3347 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
3346 |
P1113A
Sasha and His Trip
|
0 / 0 |
3 |
|
|
3341 |
P1114D
Flood Fill
|
0 / 0 |
6 |
|
|
3316 |
P1117D
Magic Gems
|
0 / 0 |
7 |
|
|
3314 |
P1117F
Crisp String
|
0 / 0 |
9 |
|
|
3305 |
P1118F2
Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
|
3300 |
P1119E
Pavel and Triangles
|
0 / 0 |
6 |
|
|
3299 |
P1119F
Niyaz and Small Degrees
|
0 / 0 |
10 |
|
|
3294 |
P1120C
Compress String
|
0 / 0 |
7 |
|
|
3293 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
3291 |
P1120F
Secret Letters
|
0 / 0 |
10 |
|
|
3284 |
P1129C
Morse Code
|
0 / 0 |
9 |
|
|
3283 |
P1129D
Isolation
|
0 / 0 |
10 |
|
|
3275 |
P1131D
Gourmet choice
|
0 / 0 |
7 |
|
|
3274 |
P1131E
String Multiplication
|
0 / 0 |
8 |
|
|
3272 |
P1131G
Most Dangerous Shark
|
0 / 0 |
10 |
|
|
3267 |
P1132E
Knapsack
|
0 / 0 |
8 |
|
|
3266 |
P1132F
Clear the String
|
0 / 0 |
7 |
|
|
3265 |
P1132G
Greedy Subsequences
|
0 / 0 |
9 |
|
|
3260 |
P1133E
K Balanced Teams
|
0 / 0 |
6 |
|
|
3250 |
P1137C
Museums Tour
|
0 / 0 |
9 |
|
|
3241 |
P1139D
Steps to One
|
0 / 0 |
8 |
|
|
3235 |
P1140D
Minimum Triangulation
|
0 / 0 |
4 |
|
|
3234 |
P1140E
Palindrome-less Arrays
|
0 / 0 |
8 |
|
|
3222 |
P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
3220 |
P1142D
Foreigner
|
0 / 0 |
10 |
|
|
3209 |
P1144G
Two Merged Sequences
|
0 / 0 |
9 |
|
|
3196 |
P1146F
Leaf Partition
|
0 / 0 |
9 |
|
|
3195 |
P1146G
Zoning Restrictions
|
0 / 0 |
10 |
|
|
3194 |
P1146H
Satanic Panic
|
0 / 0 |
10 |
|
|
3178 |
P1149B
Three Religions
|
0 / 0 |
8 |
|
|
3176 |
P1149D
Abandoning Roads
|
0 / 0 |
10 |
|
|
3171 |
P1151B
Dima and a Bad XOR
|
0 / 0 |
5 |
|
|
3168 |
P1151E
Number of Components
|
0 / 0 |
7 |
|
|
3167 |
P1151F
Sonya and Informatics
|
0 / 0 |
8 |
|
|
3163 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
3161 |
P1152F1
Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
3160 |
P1152F2
Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
3156 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
3154 |
P1153F
Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
3148 |
P1154F
Shovels Shop
|
0 / 0 |
7 |
|
|
3143 |
P1155D
Beautiful Array
|
0 / 0 |
6 |
|
|
3141 |
P1155F
Delivery Oligopoly
|
0 / 0 |
10 |
|
|
3137 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
3135 |
P1156F
Card Bag
|
0 / 0 |
8 |
|
|
3127 |
P1157F
Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
3120 |
P1158F
Density of subarrays
|
0 / 0 |
10 |
|
|
3109 |
P1163D
Mysterious Code
|
0 / 0 |
7 |
|
|
3084 |
P1168C
And Reachability
|
0 / 0 |
8 |
|
|
3083 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
3071 |
P1170I
Good Subsets
|
0 / 0 |
(无) |
|
|
3069 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
3068 |
P1172C1
Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
3067 |
P1172C2
Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
3057 |
P1174E
Ehab and the Expected GCD Problem
|
0 / 0 |
9 |
|
|
3051 |
P1175E
Minimal Segment Cover
|
0 / 0 |
8 |
|
|
3049 |
P1175G
Yet Another Partiton Problem
|
0 / 0 |
10 |
|
|
3046 |
P1176C
Lose it!
|
0 / 0 |
4 |
|
|
3043 |
P1176F
Destroy it!
|
0 / 0 |
7 |
|
|
3039 |
P1178B
WOW Factor
|
0 / 0 |
4 |
|
|
3035 |
P1178F1
Short Colorful Strip
|
0 / 0 |
8 |
|
|
3034 |
P1178F2
Long Colorful Strip
|
0 / 0 |
10 |
