Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1656	codeforces#P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	10
	1655	codeforces#P1609A Divide and Multiply greedy implementation math number theory *900	0 / 0	3
	1654	codeforces#P1609B William the Vigilant implementation strings *1100	0 / 0	3
	1653	codeforces#P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	4
	1652	codeforces#P1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	5
	1651	codeforces#P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	9
	1650	codeforces#P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1649	codeforces#P1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	10
	1648	codeforces#P1609H Pushing Robots *3500	0 / 0	10
	1647	codeforces#P1610A Anti Light's Cell Guessing math *900	0 / 0	3
	1646	codeforces#P1610B Kalindrome Array greedy two pointers *1100	0 / 0	3
	1645	codeforces#P1610C Keshi Is Throwing a Party binary search greedy *1600	0 / 0	5
	1644	codeforces#P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	1643	codeforces#P1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	8
	1642	codeforces#P1610F Mashtali: a Space Oddysey constructive algorithms dfs and similar graphs *3000	0 / 0	10
	1641	codeforces#P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	10
	1640	codeforces#P1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	10
	1639	codeforces#P1610I Mashtali vs AtCoder games trees *3100	0 / 0	10
	1638	codeforces#P1611A Make Even constructive algorithms math *800	0 / 0	3
	1637	codeforces#P1611B Team Composition: Programmers and Mathematicians binary search constructive algorithms math *800	0 / 0	3
	1636	codeforces#P1611C Polycarp Recovers the Permutation constructive algorithms *1000	0 / 0	3
	1635	codeforces#P1611D Weights Assignment For Tree Edges constructive algorithms trees *1500	0 / 0	5
	1634	codeforces#P1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	5
	1633	codeforces#P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	6
	1632	codeforces#P1611F ATM and Students binary search data structures two pointers *1800	0 / 0	6
	1631	codeforces#P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	9
	1630	codeforces#P1612A Distance brute force constructive algorithms *800	0 / 0	3
	1629	codeforces#P1612B Special Permutation constructive algorithms greedy *900	0 / 0	3
	1628	codeforces#P1612C Chat Ban binary search math *1300	0 / 0	4
	1627	codeforces#P1612D X-Magic Pair math number theory *1600	0 / 0	5
	1626	codeforces#P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	1625	codeforces#P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1624	codeforces#P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	9
	1623	codeforces#P1613A Long Comparison implementation math *900	0 / 0	3
	1622	codeforces#P1613B Absent Remainder greedy implementation sortings *1000	0 / 0	3
	1621	codeforces#P1613C Poisoned Dagger binary search *1200	0 / 0	4
	1620	codeforces#P1613D MEX Sequences dp math *1900	0 / 0	6
	1619	codeforces#P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	7
	1618	codeforces#P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	10
	1617	codeforces#P1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	3
	1616	codeforces#P1614B Divan and a New Project constructive algorithms sortings *1000	0 / 0	3
	1615	codeforces#P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	5
	1614	codeforces#P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	7
	1613	codeforces#P1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	8
	1612	codeforces#P1614E Divan and a Cottage binary search data structures *2600	0 / 0	10
	1611	codeforces#P1615A Closing The Gap greedy math *800	0 / 0	3
	1610	codeforces#P1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	4
	1609	codeforces#P1615C Menorah brute force graphs greedy math *1600	0 / 0	5
	1608	codeforces#P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	1607	codeforces#P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	9
	1606	codeforces#P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	10
	1605	codeforces#P1615G Maximum Adjacent Pairs constructive algorithms graph matchings *3300	0 / 0	10
	1604	codeforces#P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	1603	codeforces#P1616A Integer Diversity implementation *800	0 / 0	3
	1602	codeforces#P1616B Mirror in the String greedy strings *1100	0 / 0	3
	1601	codeforces#P1616C Representative Edges brute force geometry implementation math *1500	0 / 0	5
	1600	codeforces#P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	1599	codeforces#P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	1598	codeforces#P1616F Tricolor Triangles brute force graphs math matrices *2900	0 / 0	10
	1597	codeforces#P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	10
	1596	codeforces#P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	10
	1595	codeforces#P1617A Forbidden Subsequence constructive algorithms greedy sortings strings *800	0 / 0	3
	1594	codeforces#P1617B GCD Problem brute force constructive algorithms math number theory *900	0 / 0	3
	1593	codeforces#P1617C Paprika and Permutation binary search greedy math sortings *1300	0 / 0	4
	1592	codeforces#P1617D1 Too Many Impostors (easy version) constructive algorithms implementation interactive *1800	0 / 0	6
	1591	codeforces#P1617D2 Too Many Impostors (hard version) constructive algorithms implementation interactive math *2400	0 / 0	9
	1590	codeforces#P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	1589	codeforces#P1618A Polycarp and Sums of Subsequences math sortings *800	0 / 0	3
	1588	codeforces#P1618B Missing Bigram implementation *800	0 / 0	3
	1587	codeforces#P1618C Paint the Array math *1100	0 / 0	3
	1586	codeforces#P1618D Array and Operations dp greedy math *1300	0 / 0	4
	1585	codeforces#P1618E Singers' Tour constructive algorithms math *1700	0 / 0	5
	1584	codeforces#P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	7
	1583	codeforces#P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	8
	1582	codeforces#P1619A Square String? implementation strings *800	0 / 0	3
	1581	codeforces#P1619B Squares and Cubes implementation math *800	0 / 0	3
	1580	codeforces#P1619C Wrong Addition implementation *1200	0 / 0	4
	1579	codeforces#P1619D New Year's Problem binary search greedy sortings *1800	0 / 0	6
	1578	codeforces#P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	5
	1577	codeforces#P1619F Let's Play the Hat? brute force constructive algorithms greedy math *2000	0 / 0	7
	1576	codeforces#P1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	7
	1575	codeforces#P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	9
	1574	codeforces#P1620A Equal or Not Equal constructive algorithms dsu implementation *800	0 / 0	3
	1573	codeforces#P1620B Triangles on a Rectangle geometry greedy math *1000	0 / 0	3
	1572	codeforces#P1620C BA-String brute force dp greedy implementation math *1800	0 / 0	6
	1571	codeforces#P1620D Exact Change brute force constructive algorithms greedy *2000	0 / 0	7
	1570	codeforces#P1620E Replace the Numbers constructive algorithms data structures dsu implementation *1900	0 / 0	6
	1569	codeforces#P1620F Bipartite Array dp greedy *2800	0 / 0	10
	1568	codeforces#P1620G Subsequences Galore bitmasks combinatorics dp *2400	0 / 0	9
	1567	codeforces#P1621A Stable Arrangement of Rooks constructive algorithms *800	0 / 0	3
	1566	codeforces#P1621B Integers Shop data structures greedy implementation *1500	0 / 0	5
	1565	codeforces#P1621C Hidden Permutations dfs and similar interactive math *1700	0 / 0	5
	1564	codeforces#P1621D The Winter Hike constructive algorithms greedy math *2100	0 / 0	7
	1563	codeforces#P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	8
	1562	codeforces#P1621F Strange Instructions data structures greedy implementation *2700	0 / 0	10
	1561	codeforces#P1621G Weighted Increasing Subsequences data structures dp math *3200	0 / 0	10
	1560	codeforces#P1621H Trains and Airplanes dfs and similar graphs shortest paths trees *3500	0 / 0	10
	1559	codeforces#P1621I Two Sequences data structures hashing string suffix structures *3500	0 / 0	10
	1558	codeforces#P1622A Construct a Rectangle geometry math *800	0 / 0	3
	1557	codeforces#P1622B Berland Music data structures greedy math sortings *1000	0 / 0	3

Pick a problem randomly based on the current filter.