Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1784	P1579E1 Permutation Minimization by Deque constructive algorithms greedy math *1000	0 / 0	3
	1783	P1579E2 Array Optimization by Deque data structures greedy *1700	0 / 0	5
	1782	P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	5
	1781	P1579G Minimal Coverage dp *2200	0 / 0	8
	1780	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	5
	1779	P1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	10
	1778	P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	8
	1777	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	10
	1776	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	10
	1775	P1580F Problems for Codeforces combinatorics fft math *3300	0 / 0	10
	1774	P1581A CQXYM Count Permutations combinatorics math number theory *800	0 / 0	3
	1773	P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	4
	1772	P1582A Luntik and Concerts math *800	0 / 0	3
	1771	P1582B Luntik and Subsequences combinatorics math *900	0 / 0	3
	1770	P1582C Grandma Capa Knits a Scarf brute force data structures greedy strings two pointers *1200	0 / 0	4
	1769	P1582D Vupsen, Pupsen and 0 constructive algorithms math *1600	0 / 0	5
	1768	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	7
	1767	P1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	6
	1766	P1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	9
	1765	P1582G Kuzya and Homework data structures number theory *2600	0 / 0	10
	1764	P1583A Windblume Ode math number theory *800	0 / 0	3
	1763	P1583B Omkar and Heavenly Tree constructive algorithms trees *1200	0 / 0	4
	1762	P1583C Omkar and Determination data structures dp *1700	0 / 0	5
	1761	P1583D Omkar and the Meaning of Life constructive algorithms greedy interactive *1800	0 / 0	6
	1760	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1759	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	9
	1758	P1583G Omkar and Time Travel data structures math *3000	0 / 0	10
	1757	P1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	10
	1756	P1584A Mathematical Addition math *800	0 / 0	3
	1755	P1584B Coloring Rectangles greedy math *1000	0 / 0	3
	1754	P1584C Two Arrays greedy math sortings *900	0 / 0	3
	1753	P1584D Guess the Permutation binary search combinatorics interactive math *2000	0 / 0	7
	1752	P1584E Game with Stones binary search data structures games greedy *2300	0 / 0	8
	1751	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	10
	1750	P1584G Eligible Segments geometry *3200	0 / 0	10
	1749	P1585A Life of a Flower implementation *800	0 / 0	3
	1748	P1585B Array Eversion greedy *900	0 / 0	3
	1747	P1585C Minimize Distance greedy *1300	0 / 0	4
	1746	P1585D Yet Another Sorting Problem data structures math *1900	0 / 0	6
	1745	P1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	9
	1744	P1585F Non-equal Neighbours combinatorics dp math *2400	0 / 0	9
	1743	P1585G Poachers dp games graphs trees *2500	0 / 0	9
	1742	P1586I Omkar and Mosaic combinatorics constructive algorithms math *3500	0 / 0	10
	1741	P1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	10
	1740	P1592A Gamer Hemose binary search greedy math sortings *800	0 / 0	3
	1739	P1592B Hemose Shopping constructive algorithms dsu math sortings *1200	0 / 0	4
	1738	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	5
	1737	P1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	8
	1736	P1592E Bored Bakry bitmasks greedy math two pointers *2400	0 / 0	9
	1735	P1592F1 Alice and Recoloring 1 constructive algorithms greedy *2600	0 / 0	10
	1734	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1733	P1593A Elections math *800	0 / 0	3
	1732	P1593B Make it Divisible by 25 dfs and similar dp greedy math math *900	0 / 0	3
	1731	P1593C Save More Mice binary search greedy greedy *1000	0 / 0	3
	1730	P1593D1 All are Same math number theory *1100	0 / 0	3
	1729	P1593D2 Half of Same brute force math number theory *1900	0 / 0	6
	1728	P1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	5
	1727	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	1726	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	8
	1725	P1594A Consecutive Sum Riddle math *800	0 / 0	3
	1724	P1594B Special Numbers bitmasks math *1100	0 / 0	3
	1723	P1594C Make Them Equal brute force greedy math strings *1200	0 / 0	4
	1722	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	5
	1721	P1594E1 Rubik's Cube Coloring (easy version) combinatorics math *1300	0 / 0	4
	1720	P1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	8
	1719	P1594F Ideal Farm constructive algorithms math *2400	0 / 0	9
	1718	P1598A Computer Game brute force dfs and similar dp implementation *800	0 / 0	3
	1717	P1598B Groups brute force implementation *1000	0 / 0	3
	1716	P1598C Delete Two Elements data structures dp implementation math two pointers *1200	0 / 0	4
	1715	P1598D Training Session combinatorics data structures geometry implementation math *1700	0 / 0	5
	1714	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	7
	1713	P1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	9
	1712	P1598G The Sum of Good Numbers hashing math string suffix structures strings *3200	0 / 0	10
	1711	P1599A Weights constructive algorithms greedy two pointers *2600	0 / 0	10
	1710	P1599B Restaurant Game *3100	0 / 0	10
	1709	P1599C Bubble Strike combinatorics math probabilities ternary search *2000	0 / 0	7
	1708	P1599D Bubble Popping *3200	0 / 0	10
	1707	P1599E Two Arrays data structures matrices *3200	0 / 0	10
	1706	P1599F Mars hashing *2700	0 / 0	10
	1705	P1599G Shortest path brute force geometry math shortest paths *2700	0 / 0	10
	1704	P1599H Hidden Fortress interactive math *2100	0 / 0	7
	1703	P1599I Desert data structures graphs *2700	0 / 0	10
	1702	P1599J Bob's Beautiful Array bitmasks brute force greedy *2600	0 / 0	10
	1701	P1600E Array Game games greedy two pointers *1900	0 / 0	6
	1700	P1600F Party Organization brute force math probabilities *2300	0 / 0	8
	1699	P1600J Robot Factory bitmasks dfs and similar *1400	0 / 0	4
	1698	P1601A Array Elimination bitmasks greedy math number theory *1300	0 / 0	4
	1697	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	6
	1696	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	8
	1695	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	10
	1694	P1601E Phys Ed Online data structures dp greedy *2900	0 / 0	10
	1693	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	10
	1692	P1602A Two Subsequences implementation *800	0 / 0	3
	1691	P1602B Divine Array constructive algorithms implementation *1100	0 / 0	3
	1690	P1603A Di-visible Confusion constructive algorithms math number theory *1300	0 / 0	4
	1689	P1603B Moderate Modular Mode constructive algorithms math number theory *1600	0 / 0	5
	1688	P1603C Extreme Extension dp greedy math number theory *2300	0 / 0	8
	1687	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	10
	1686	P1603E A Perfect Problem combinatorics dp math *3200	0 / 0	10
	1685	P1603F October 18, 2017 combinatorics dp implementation math *2700	0 / 0	10

Pick a problem randomly based on the current filter.