Problem Set - *2800 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4317	P1088F Ehab and a weird weight formula data structures trees *2800	0 / 0	10
	4244	P1098D Eels data structures *2800	0 / 0	10
	4184	P1109C Sasha and a Patient Friend binary search data structures implementation *2800	0 / 0	10
	4041	P1142D Foreigner dp *2800	0 / 0	10
	3982	P1152F1 Neko Rules the Catniverse (Small Version) bitmasks dp matrices *2800	0 / 0	10
	3962	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	10
	3679	P1208G Polygons greedy math number theory *2800	0 / 0	10
	3635	P1214H Tiles Placement constructive algorithms dfs and similar trees *2800	0 / 0	10
	3615	P1218A BubbleReactor dp graphs *2800	0 / 0	10
	3391	P1267D DevOps Best Practices constructive algorithms *2800	0 / 0	10
	3334	P1279F New Year and Handle Change binary search dp *2800	0 / 0	10
	3297	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	10
	3277	P1291F Coffee Varieties (easy version) graphs interactive *2800	0 / 0	10
	3212	P1303F Number of Components dsu implementation *2800	0 / 0	10
	3186	P1310C Au Pont Rouge binary search dp strings *2800	0 / 0	10
	3155	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	10
	3143	P1322D Reality Show bitmasks dp *2800	0 / 0	10
	3111	P1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	10
	2890	P1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	10
	2847	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	10
	2820	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	2813	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	2811	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	10
	2792	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	10
	2791	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	10
	2777	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	10
	2761	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	2742	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	2737	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	10
	2706	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	2689	P1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	10
	2688	P1404E Bricks flows graph matchings graphs *2800	0 / 0	10
	2648	P1413F Roads and Ramen data structures trees *2800	0 / 0	10
	2620	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	10
	2590	P1423M Milutin's Plums interactive *2800	0 / 0	10
	2579	P1425I Impressive Harvesting of The Orchard data structures *2800	0 / 0	10
	2525	P1436F Sum Over Subsets combinatorics math number theory *2800	0 / 0	10
	2500	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	10
	2436	P1455F String and Operations dp greedy *2800	0 / 0	10
	2350	P1473G Tiles combinatorics dp fft math *2800	0 / 0	10
	2326	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	10
	2271	P1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	10
	2255	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	10
	2161	P1510F Fiber Shape *2800	0 / 0	10
	2076	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	1967	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	1890	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	10
	1826	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	1801	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	10
	1800	P1578B Building Forest Trails data structures dsu *2800	0 / 0	10
	1791	P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	10
	1734	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1671	P1606F Tree Queries brute force dp trees *2800	0 / 0	10
	1658	P1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	10
	1650	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1625	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1606	P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	10
	1569	P1620F Bipartite Array dp greedy *2800	0 / 0	10
	1535	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	10
	1529	P1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	10
	1494	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	10
	1482	P1635F Closest Pair data structures greedy *2800	0 / 0	10
	1427	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	10
	1404	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	1286	P1672F2 Checker for Array Shuffling constructive algorithms dfs and similar graphs *2800	0 / 0	10
	1214	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	1209	P1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	10
	1166	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1142	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	10
	1136	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	10
	1001	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	985	P1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	10
	940	P1732E Location data structures dp math number theory *2800	0 / 0	10
	851	P1746F Kazaee data structures hashing probabilities *2800	0 / 0	10
	833	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	10
	756	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	745	P1766F MCF flows *2800	0 / 0	10
	712	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	687	P1776D Teamwork constructive algorithms greedy math *2800	0 / 0	10
	635	P1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	10
	483	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	10
	476	P1809G Prediction combinatorics dp math *2800	0 / 0	10
	470	P1810F M-tree data structures math sortings trees *2800	0 / 0	10
	424	P1819D Misha and Apples brute force data structures dp two pointers *2800	0 / 0	10
	386	P1826F Fading into Fog geometry interactive math probabilities *2800	0 / 0	10
	381	P1827D Two Centroids data structures dfs and similar greedy trees *2800	0 / 0	10
	365	P1830D Mex Tree brute force dp trees *2800	0 / 0	10
	295	P1842G Tenzing and Random Operations combinatorics dp math probabilities *2800	0 / 0	10
	279	P1844F2 Min Cost Permutation (Hard Version) binary search constructive algorithms data structures greedy math sortings *2800	0 / 0	10
	271	P1845F Swimmers in the Pool dp fft math number theory *2800	0 / 0	10
	226	P1852D Miriany and Matchstick constructive algorithms dp greedy *2800	0 / 0	10
	162	P1863G Swaps combinatorics dp graphs math *2800	0 / 0	10
	141	P1866J Jackets and Packets dp *2800	0 / 0	10
	95	P1874D Jellyfish and Miku divide and conquer dp math probabilities *2800	0 / 0	10
	67	P1879F Last Man Standing brute force data structures number theory *2800	0 / 0	10
	41	P1884E Hard Design greedy implementation math *2800	0 / 0	10
	5344	P1900F Local Deletions binary search data structures implementation *2800	0 / 0	10
	6704	P1904F Beautiful Tree data structures dfs and similar graphs implementation trees *2800	0 / 0	10
	6616	P1906D Spaceship Exploration binary search geometry *2800	0 / 0	10
	6660	P1913F Palindromic Problem binary search data structures hashing string suffix structures strings *2800	0 / 0	10

Pick a problem randomly based on the current filter.