Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1684	P1604A Era greedy *800	0 / 0	3
	1683	P1604B XOR Specia-LIS-t *1100	0 / 0	3
	1682	P1605A A.M math number theory *800	0 / 0	3
	1681	P1605B Reverse Sort greedy sortings *1000	0 / 0	3
	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
	1677	P1605F PalindORme combinatorics dp *2900	0 / 0	10
	1676	P1606A AB Balance strings *900	0 / 0	3
	1675	P1606B Update Files greedy implementation math *1100	0 / 0	3
	1674	P1606C Banknotes greedy number theory *1400	0 / 0	4
	1673	P1606D Red-Blue Matrix brute force constructive algorithms implementation sortings *2400	0 / 0	9
	1672	P1606E Arena combinatorics dp math *2100	0 / 0	7
	1671	P1606F Tree Queries brute force dp trees *2800	0 / 0	10
	1670	P1607A Linear Keyboard implementation strings *800	0 / 0	3
	1669	P1607B Odd Grasshopper math *900	0 / 0	3
	1668	P1607C Minimum Extraction brute force sortings *1000	0 / 0	3
	1667	P1607D Blue-Red Permutation greedy math sortings *1300	0 / 0	4
	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
	1664	P1607G Banquet Preparations 1 greedy *2200	0 / 0	8
	1663	P1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	8
	1662	P1608A Find Array constructive algorithms math *800	0 / 0	3
	1661	P1608B Build the Permutation constructive algorithms greedy *1200	0 / 0	4
	1660	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	5
	1659	P1608D Dominoes combinatorics fft graphs math number theory *2400	0 / 0	9
	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
	1656	P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	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
	1651	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	9
	1650	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1649	P1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	10
	1648	P1609H Pushing Robots *3500	0 / 0	10
	1647	P1610A Anti Light's Cell Guessing math *900	0 / 0	3
	1646	P1610B Kalindrome Array greedy two pointers *1100	0 / 0	3
	1645	P1610C Keshi Is Throwing a Party binary search greedy *1600	0 / 0	5
	1644	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	1643	P1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	8
	1642	P1610F Mashtali: a Space Oddysey constructive algorithms dfs and similar graphs *3000	0 / 0	10
	1641	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	10
	1640	P1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	10
	1639	P1610I Mashtali vs AtCoder games trees *3100	0 / 0	10
	1638	P1611A Make Even constructive algorithms math *800	0 / 0	3
	1637	P1611B Team Composition: Programmers and Mathematicians binary search constructive algorithms math *800	0 / 0	3
	1636	P1611C Polycarp Recovers the Permutation constructive algorithms *1000	0 / 0	3
	1635	P1611D Weights Assignment For Tree Edges constructive algorithms trees *1500	0 / 0	5
	1634	P1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	5
	1633	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	6
	1632	P1611F ATM and Students binary search data structures two pointers *1800	0 / 0	6
	1631	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	9
	1630	P1612A Distance brute force constructive algorithms *800	0 / 0	3
	1629	P1612B Special Permutation constructive algorithms greedy *900	0 / 0	3
	1628	P1612C Chat Ban binary search math *1300	0 / 0	4
	1627	P1612D X-Magic Pair math number theory *1600	0 / 0	5
	1626	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	1625	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1624	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	9
	1623	P1613A Long Comparison implementation math *900	0 / 0	3
	1622	P1613B Absent Remainder greedy implementation sortings *1000	0 / 0	3
	1621	P1613C Poisoned Dagger binary search *1200	0 / 0	4
	1620	P1613D MEX Sequences dp math *1900	0 / 0	6
	1619	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	7
	1618	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	10
	1617	P1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	3
	1616	P1614B Divan and a New Project constructive algorithms sortings *1000	0 / 0	3
	1615	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	5
	1614	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	7
	1613	P1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	8
	1612	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	10
	1611	P1615A Closing The Gap greedy math *800	0 / 0	3
	1610	P1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	4
	1609	P1615C Menorah brute force graphs greedy math *1600	0 / 0	5
	1608	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	1607	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	9
	1606	P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	10
	1605	P1615G Maximum Adjacent Pairs constructive algorithms graph matchings *3300	0 / 0	10
	1604	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	1603	P1616A Integer Diversity implementation *800	0 / 0	3
	1602	P1616B Mirror in the String greedy strings *1100	0 / 0	3
	1601	P1616C Representative Edges brute force geometry implementation math *1500	0 / 0	5
	1600	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	1599	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	1598	P1616F Tricolor Triangles brute force graphs math matrices *2900	0 / 0	10
	1597	P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	10
	1596	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	10
	1595	P1617A Forbidden Subsequence constructive algorithms greedy sortings strings *800	0 / 0	3
	1594	P1617B GCD Problem brute force constructive algorithms math number theory *900	0 / 0	3
	1593	P1617C Paprika and Permutation binary search greedy math sortings *1300	0 / 0	4
	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
	1590	P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	1589	P1618A Polycarp and Sums of Subsequences math sortings *800	0 / 0	3
	1588	P1618B Missing Bigram implementation *800	0 / 0	3
	1587	P1618C Paint the Array math *1100	0 / 0	3
	1586	P1618D Array and Operations dp greedy math *1300	0 / 0	4
	1585	P1618E Singers' Tour constructive algorithms math *1700	0 / 0	5

Pick a problem randomly based on the current filter.