Problem Set - *2100 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4806	P985E Pencils and Boxes binary search data structures dp greedy two pointers *2100	0 / 0	7
	4790	P988E Divisibility by 25 brute force greedy *2100	0 / 0	7
	4789	P988F Rain and Umbrellas dp *2100	0 / 0	7
	4779	P990E Post Lamps brute force greedy *2100	0 / 0	7
	4767	P992D Nastya and a Game brute force implementation math *2100	0 / 0	7
	4763	P993C Careful Maneuvering bitmasks brute force geometry *2100	0 / 0	7
	4757	P995A Tesla constructive algorithms implementation *2100	0 / 0	7
	4732	P1000E We Need More Bosses dfs and similar graphs trees *2100	0 / 0	7
	4701	P1003E Tree Constructing constructive algorithms graphs *2100	0 / 0	7
	4687	P1005F Berland and the Shortest Paths brute force dfs and similar graphs shortest paths *2100	0 / 0	7
	4681	P1006F Xor-Paths bitmasks brute force dp meet-in-the-middle *2100	0 / 0	7
	4617	P1023E Down or Right constructive algorithms interactive matrices *2100	0 / 0	7
	4611	P1025D Recovering BST brute force dp math number theory trees *2100	0 / 0	7
	4603	P1027E Inverse Coloring combinatorics dp math *2100	0 / 0	7
	4597	P1028D Order book combinatorics data structures greedy *2100	0 / 0	7
	4588	P1029E Tree with Small Distances dp graphs greedy *2100	0 / 0	7
	4569	P1032E The Unbearable Lightness of Weights dp math *2100	0 / 0	7
	4532	P1039B Subway Pursuit binary search interactive probabilities *2100	0 / 0	7
	4505	P1044C Optimal Polygon Perimeter dp geometry *2100	0 / 0	7
	4459	P1056E Check Transcription brute force data structures hashing strings *2100	0 / 0	7
	4407	P1066F Yet another 2D Walking dp *2100	0 / 0	7
	4394	P1070E Getting Deals Done binary search data structures *2100	0 / 0	7
	4362	P1077F2 Pictures with Kittens (hard version) data structures dp *2100	0 / 0	7
	4246	P1098B Nice table brute force constructive algorithms greedy math *2100	0 / 0	7
	4202	P1106E Lunar New Year and Red Envelopes data structures dp *2100	0 / 0	7
	4188	P1108E2 Array and Segments (Hard version) data structures implementation *2100	0 / 0	7
	4187	P1108F MST Unification binary search dsu graphs greedy *2100	0 / 0	7
	4137	P1117D Magic Gems dp math matrices *2100	0 / 0	7
	4115	P1120C Compress String dp strings *2100	0 / 0	7
	4019	P1146D Frog Jumping dfs and similar math number theory *2100	0 / 0	7
	3989	P1151E Number of Components combinatorics data structures dp math *2100	0 / 0	7
	3984	P1152D Neko and Aki's Prank dp greedy trees *2100	0 / 0	7
	3969	P1154F Shovels Shop dp greedy sortings *2100	0 / 0	7
	3944	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	7
	3930	P1163D Mysterious Code dp strings *2100	0 / 0	7
	3916	P1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	7
	3910	P1167E Range Deleting binary search combinatorics data structures two pointers *2100	0 / 0	7
	3864	P1176F Destroy it! dp implementation sortings *2100	0 / 0	7
	3828	P1183F Topforces Strikes Back brute force math sortings *2100	0 / 0	7
	3824	P1184A2 Heidi Learns Hashing (Medium) brute force number theory *2100	0 / 0	7
	3813	P1184E2 Daleks' Invasion (medium) dfs and similar graphs shortest paths trees *2100	0 / 0	7
	3805	P1185F Two Pizzas bitmasks brute force *2100	0 / 0	7
	3804	P1185G1 Playlist for Polycarp (easy version) bitmasks combinatorics dp *2100	0 / 0	7
	3793	P1187E Tree Painting dfs and similar dp trees *2100	0 / 0	7
	3755	P1195E OpenStreetMap data structures two pointers *2100	0 / 0	7
	3723	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	7
	3718	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	7
	3708	P1203F1 Complete the Projects (easy version) greedy *2100	0 / 0	7
	3702	P1204D2 Kirk and a Binary String (hard version) data structures greedy math strings *2100	0 / 0	7
	3687	P1207F Remainder Problem brute force data structures implementation *2100	0 / 0	7
	3644	P1213F Unstable String Sort data structures dfs and similar dsu graphs greedy implementation strings *2100	0 / 0	7
	3622	P1216F Wi-Fi data structures dp greedy *2100	0 / 0	7
	3618	P1217D Coloring Edges constructive algorithms dfs and similar graphs *2100	0 / 0	7
	3607	P1218I The Light Square 2-sat dfs and similar greedy *2100	0 / 0	7
	3586	P1223E Paint the Tree dp sortings trees *2100	0 / 0	7
	3484	P1250C Trip to Saint Petersburg data structures *2100	0 / 0	7
	3459	P1252G Performance Review data structures *2100	0 / 0	7
	3455	P1252K Addition Robot data structures math matrices *2100	0 / 0	7
	3445	P1254B2 Send Boxes to Alice (Hard Version) constructive algorithms greedy math number theory ternary search two pointers *2100	0 / 0	7
	3414	P1263E Editor data structures implementation *2100	0 / 0	7
	3403	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	7
	3398	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	7
	3384	P1267K Key Storage combinatorics math *2100	0 / 0	7
	3363	P1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	7
	3362	P1271E Common Number binary search combinatorics dp math *2100	0 / 0	7
	3342	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	7
	3310	P1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	7
	3250	P1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	7
	3238	P1299C Water Balance data structures geometry greedy *2100	0 / 0	7
	3172	P1312E Array Shrinking dp greedy *2100	0 / 0	7
	3145	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	7
	3085	P1332E Height All the Same combinatorics constructive algorithms math matrices *2100	0 / 0	7
	3079	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	3028	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	2973	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	7
	2966	P1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	7
	2917	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	7
	2904	P1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	7
	2898	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	7
	2891	P1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	7
	2885	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	2877	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	7
	2856	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	7
	2843	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	2776	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	7
	2775	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	2764	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	7
	2751	P1392E Omkar and Duck bitmasks constructive algorithms interactive math *2100	0 / 0	7
	2743	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	7
	2661	P1409F Subsequences of Length Two dp strings *2100	0 / 0	7
	2657	P1411D Grime Zoo brute force greedy implementation strings *2100	0 / 0	7
	2649	P1413E Solo mid Oracle greedy math ternary search *2100	0 / 0	7
	2630	P1418D Trash Problem data structures implementation *2100	0 / 0	7
	2621	P1419E Decryption constructive algorithms implementation math number theory *2100	0 / 0	7
	2616	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	2543	P1431F Neural Network Problem special problem binary search greedy 2100	0 / 0	7
	2542	P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	7
	2533	P1433F Zero Remainder Sum dp *2100	0 / 0	7
	2532	P1433G Reducing Delivery Cost brute force graphs shortest paths *2100	0 / 0	7
	2484	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7

Pick a problem randomly based on the current filter.