Problem Set - implementation - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2087	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	5
	2079	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2065	P1527C Sequence Pair Weight hashing implementation math *1600	0 / 0	5
	2064	P1527D MEX Tree combinatorics dfs and similar implementation math trees *2400	0 / 0	9
	2053	P1530B Putting Plates constructive algorithms implementation *800	0 / 0	3
	2044	P1532C Uniform String *special problem implementation	0 / 0	(None)
	2040	P1533A Travel to Bertown *special problem implementation math	0 / 0	(None)
	2039	P1533B Nearest Point Function *special problem implementation	0 / 0	(None)
	2038	P1533C Sweets *special problem data structures implementation	0 / 0	(None)
	2030	P1534A Colour the Flag brute force implementation *800	0 / 0	3
	2029	P1534B Histogram Ugliness greedy implementation math *1100	0 / 0	3
	2021	P1535A Fair Playoff brute force implementation *800	0 / 0	3
	2019	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2018	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	6
	2016	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	2012	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	2007	P1537C Challenging Cliffs constructive algorithms greedy implementation math *1200	0 / 0	4
	2005	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	1998	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	1994	P1539B Love Song dp implementation strings *800	0 / 0	3
	1992	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	5
	1991	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	1983	P1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	3
	1982	P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	4
	1978	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	8
	1973	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	6
	1960	P1547A Shortest Path with Obstacle implementation math *800	0 / 0	3
	1959	P1547B Alphabetical Strings greedy implementation strings *800	0 / 0	3
	1956	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	5
	1946	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	1943	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	5
	1942	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	8
	1934	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	7
	1921	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	4
	1911	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	1906	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	4
	1901	P1556B Take Your Places! implementation *1300	0 / 0	4
	1900	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	6
	1877	P1560A Dislike of Threes implementation *800	0 / 0	3
	1875	P1560C Infinity Table implementation math *800	0 / 0	3
	1873	P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	6
	1870	P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	3
	1866	P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	3
	1856	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	5
	1854	P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	10
	1853	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	10
	1851	P1567A Domino Disaster implementation strings *800	0 / 0	3
	1848	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	7
	1846	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	10
	1845	P1569A Balanced Substring implementation *800	0 / 0	3
	1842	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	6
	1841	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	10
	1837	P1571C Rhyme special problem implementation 1800	0 / 0	6
	1836	P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	6
	1829	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	1818	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	1817	P1574E Coloring combinatorics constructive algorithms implementation math *2500	0 / 0	9
	1806	P1575J Jeopardy of Dropped Balls binary search brute force dsu implementation *1500	0 / 0	5
	1805	P1575K Knitting Batik implementation math *2200	0 / 0	8
	1797	P1578E Easy Scheduling implementation math *1200	0 / 0	4
	1794	P1578H Higher Order Functions implementation strings *1700	0 / 0	5
	1791	P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	10
	1787	P1579B Shifting Sort implementation sortings *1100	0 / 0	3
	1786	P1579C Ticks greedy implementation *1500	0 / 0	5
	1780	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	5
	1778	P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	8
	1749	P1585A Life of a Flower implementation *800	0 / 0	3
	1737	P1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	8
	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
	1720	P1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	8
	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
	1692	P1602A Two Subsequences implementation *800	0 / 0	3
	1691	P1602B Divine Array constructive algorithms implementation *1100	0 / 0	3
	1685	P1603F October 18, 2017 combinatorics dp implementation math *2700	0 / 0	10
	1680	P1605C Dominant Character brute force greedy implementation strings *1400	0 / 0	4
	1679	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	7
	1678	P1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	9
	1675	P1606B Update Files greedy implementation math *1100	0 / 0	3
	1673	P1606D Red-Blue Matrix brute force constructive algorithms implementation sortings *2400	0 / 0	9
	1670	P1607A Linear Keyboard implementation strings *800	0 / 0	3
	1666	P1607E Robot on the Board 1 implementation *1600	0 / 0	5
	1665	P1607F Robot on the Board 2 brute force dfs and similar graphs implementation *2300	0 / 0	8
	1658	P1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	10
	1657	P1608F MEX counting combinatorics dp implementation *3200	0 / 0	10
	1655	P1609A Divide and Multiply greedy implementation math number theory *900	0 / 0	3
	1654	P1609B William the Vigilant implementation strings *1100	0 / 0	3
	1653	P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	4
	1652	P1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	5
	1643	P1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	8
	1623	P1613A Long Comparison implementation math *900	0 / 0	3
	1622	P1613B Absent Remainder greedy implementation sortings *1000	0 / 0	3
	1603	P1616A Integer Diversity implementation *800	0 / 0	3
	1601	P1616C Representative Edges brute force geometry implementation math *1500	0 / 0	5
	1592	P1617D1 Too Many Impostors (easy version) constructive algorithms implementation interactive *1800	0 / 0	6
	1591	P1617D2 Too Many Impostors (hard version) constructive algorithms implementation interactive math *2400	0 / 0	9

Pick a problem randomly based on the current filter.