Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1856	codeforces#P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	5
	1855	codeforces#P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	7
	1854	codeforces#P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	10
	1853	codeforces#P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	10
	1852	codeforces#P1566H Xor-quiz constructive algorithms dp interactive math number theory *3200	0 / 0	10
	1851	codeforces#P1567A Domino Disaster implementation strings *800	0 / 0	3
	1850	codeforces#P1567B MEXor Mixup bitmasks greedy *1000	0 / 0	3
	1849	codeforces#P1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	5
	1848	codeforces#P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	7
	1847	codeforces#P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	8
	1846	codeforces#P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	10
	1845	codeforces#P1569A Balanced Substring implementation *800	0 / 0	3
	1844	codeforces#P1569B Chess Tournament constructive algorithms *1000	0 / 0	3
	1843	codeforces#P1569C Jury Meeting combinatorics math *1500	0 / 0	5
	1842	codeforces#P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	6
	1841	codeforces#P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	10
	1840	codeforces#P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	10
	1839	codeforces#P1571A Sequence of Comparisons special problem 800	0 / 0	3
	1838	codeforces#P1571B Epic Novel special problem math 1300	0 / 0	4
	1837	codeforces#P1571C Rhyme special problem implementation 1800	0 / 0	6
	1836	codeforces#P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	6
	1835	codeforces#P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	5
	1834	codeforces#P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	7
	1833	codeforces#P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	9
	1832	codeforces#P1571H Laser Beams special problem geometry probabilities 2900	0 / 0	10
	1831	codeforces#P1571I Physical Examination special problem binary search data structures 3200	0 / 0	10
	1830	codeforces#P1571J Two Railroads special problem 3000	0 / 0	10
	1829	codeforces#P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	1828	codeforces#P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	9
	1827	codeforces#P1572C Paint dp greedy *2700	0 / 0	10
	1826	codeforces#P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	1825	codeforces#P1572E Polygon binary search dp geometry *3000	0 / 0	10
	1824	codeforces#P1572F Stations data structures *3400	0 / 0	10
	1823	codeforces#P1573A Countdown greedy *800	0 / 0	3
	1822	codeforces#P1573B Swaps greedy math sortings *1400	0 / 0	4
	1821	codeforces#P1574A Regular Bracket Sequences constructive algorithms *800	0 / 0	3
	1820	codeforces#P1574B Combinatorics Homework combinatorics greedy math *1100	0 / 0	3
	1819	codeforces#P1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	4
	1818	codeforces#P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	1817	codeforces#P1574E Coloring combinatorics constructive algorithms implementation math *2500	0 / 0	9
	1816	codeforces#P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	10
	1815	codeforces#P1575A Another Sorting Problem data structures sortings strings *1100	0 / 0	3
	1814	codeforces#P1575B Building an Amusement Park binary search geometry *2300	0 / 0	8
	1813	codeforces#P1575C Cyclic Sum data structures fft number theory *3000	0 / 0	10
	1812	codeforces#P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	6
	1811	codeforces#P1575E Eye-Pleasing City Park Tour data structures trees *2600	0 / 0	10
	1810	codeforces#P1575F Finding Expected Value math *2900	0 / 0	10
	1809	codeforces#P1575G GCD Festival math number theory *2200	0 / 0	8
	1808	codeforces#P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	8
	1807	codeforces#P1575I Illusions of the Desert data structures trees *2300	0 / 0	8
	1806	codeforces#P1575J Jeopardy of Dropped Balls binary search brute force dsu implementation *1500	0 / 0	5
	1805	codeforces#P1575K Knitting Batik implementation math *2200	0 / 0	8
	1804	codeforces#P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	7
	1803	codeforces#P1575M Managing Telephone Poles data structures geometry *2400	0 / 0	9
	1802	codeforces#P1576A Communication Routing Challenge *special problem	0 / 0	(None)
	1801	codeforces#P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	10
	1800	codeforces#P1578B Building Forest Trails data structures dsu *2800	0 / 0	10
	1799	codeforces#P1578C Cactus Lady and her Cing *3500	0 / 0	10
	1798	codeforces#P1578D Dragon Curve *3200	0 / 0	10
	1797	codeforces#P1578E Easy Scheduling implementation math *1200	0 / 0	4
	1796	codeforces#P1578F Framing Pictures geometry *2900	0 / 0	10
	1795	codeforces#P1578G Game of Chance math probabilities *3500	0 / 0	10
	1794	codeforces#P1578H Higher Order Functions implementation strings *1700	0 / 0	5
	1793	codeforces#P1578I Interactive Rays geometry interactive *3300	0 / 0	10
	1792	codeforces#P1578J Just Kingdom brute force data structures dfs and similar *3100	0 / 0	10
	1791	codeforces#P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	10
	1790	codeforces#P1578L Labyrinth binary search dsu greedy *2400	0 / 0	9
	1789	codeforces#P1578M The Mind constructive algorithms interactive probabilities *2700	0 / 0	10
	1788	codeforces#P1579A Casimir's String Solitaire math strings *800	0 / 0	3
	1787	codeforces#P1579B Shifting Sort implementation sortings *1100	0 / 0	3
	1786	codeforces#P1579C Ticks greedy implementation *1500	0 / 0	5
	1785	codeforces#P1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	4
	1784	codeforces#P1579E1 Permutation Minimization by Deque constructive algorithms greedy math *1000	0 / 0	3
	1783	codeforces#P1579E2 Array Optimization by Deque data structures greedy *1700	0 / 0	5
	1782	codeforces#P1579F Array Stabilization (AND version) brute force graphs math number theory shortest paths *1700	0 / 0	5
	1781	codeforces#P1579G Minimal Coverage dp *2200	0 / 0	8
	1780	codeforces#P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	5
	1779	codeforces#P1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	10
	1778	codeforces#P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	8
	1777	codeforces#P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	10
	1776	codeforces#P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	10
	1775	codeforces#P1580F Problems for Codeforces combinatorics fft math *3300	0 / 0	10
	1774	codeforces#P1581A CQXYM Count Permutations combinatorics math number theory *800	0 / 0	3
	1773	codeforces#P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	4
	1772	codeforces#P1582A Luntik and Concerts math *800	0 / 0	3
	1771	codeforces#P1582B Luntik and Subsequences combinatorics math *900	0 / 0	3
	1770	codeforces#P1582C Grandma Capa Knits a Scarf brute force data structures greedy strings two pointers *1200	0 / 0	4
	1769	codeforces#P1582D Vupsen, Pupsen and 0 constructive algorithms math *1600	0 / 0	5
	1768	codeforces#P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	7
	1767	codeforces#P1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	6
	1766	codeforces#P1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	9
	1765	codeforces#P1582G Kuzya and Homework data structures number theory *2600	0 / 0	10
	1764	codeforces#P1583A Windblume Ode math number theory *800	0 / 0	3
	1763	codeforces#P1583B Omkar and Heavenly Tree constructive algorithms trees *1200	0 / 0	4
	1762	codeforces#P1583C Omkar and Determination data structures dp *1700	0 / 0	5
	1761	codeforces#P1583D Omkar and the Meaning of Life constructive algorithms greedy interactive *1800	0 / 0	6
	1760	codeforces#P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1759	codeforces#P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	9
	1758	codeforces#P1583G Omkar and Time Travel data structures math *3000	0 / 0	10
	1757	codeforces#P1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	10

Pick a problem randomly based on the current filter.