Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1584	P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	7
	1583	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	8
	1582	P1619A Square String? implementation strings *800	0 / 0	3
	1581	P1619B Squares and Cubes implementation math *800	0 / 0	3
	1580	P1619C Wrong Addition implementation *1200	0 / 0	4
	1579	P1619D New Year's Problem binary search greedy sortings *1800	0 / 0	6
	1578	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	5
	1577	P1619F Let's Play the Hat? brute force constructive algorithms greedy math *2000	0 / 0	7
	1576	P1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	7
	1575	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	9
	1574	P1620A Equal or Not Equal constructive algorithms dsu implementation *800	0 / 0	3
	1573	P1620B Triangles on a Rectangle geometry greedy math *1000	0 / 0	3
	1572	P1620C BA-String brute force dp greedy implementation math *1800	0 / 0	6
	1571	P1620D Exact Change brute force constructive algorithms greedy *2000	0 / 0	7
	1570	P1620E Replace the Numbers constructive algorithms data structures dsu implementation *1900	0 / 0	6
	1569	P1620F Bipartite Array dp greedy *2800	0 / 0	10
	1568	P1620G Subsequences Galore bitmasks combinatorics dp *2400	0 / 0	9
	1567	P1621A Stable Arrangement of Rooks constructive algorithms *800	0 / 0	3
	1566	P1621B Integers Shop data structures greedy implementation *1500	0 / 0	5
	1565	P1621C Hidden Permutations dfs and similar interactive math *1700	0 / 0	5
	1564	P1621D The Winter Hike constructive algorithms greedy math *2100	0 / 0	7
	1563	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	8
	1562	P1621F Strange Instructions data structures greedy implementation *2700	0 / 0	10
	1561	P1621G Weighted Increasing Subsequences data structures dp math *3200	0 / 0	10
	1560	P1621H Trains and Airplanes dfs and similar graphs shortest paths trees *3500	0 / 0	10
	1559	P1621I Two Sequences data structures hashing string suffix structures *3500	0 / 0	10
	1558	P1622A Construct a Rectangle geometry math *800	0 / 0	3
	1557	P1622B Berland Music data structures greedy math sortings *1000	0 / 0	3
	1556	P1622C Set or Decrease binary search brute force greedy sortings *1600	0 / 0	5
	1555	P1622D Shuffle combinatorics math two pointers *2000	0 / 0	7
	1554	P1622E Math Test bitmasks brute force greedy *2200	0 / 0	8
	1553	P1622F Quadratic Set constructive algorithms hashing math number theory *2900	0 / 0	10
	1552	P1623A Robot Cleaner brute force implementation math *800	0 / 0	3
	1551	P1623B Game on Ranges brute force dfs and similar implementation sortings *1100	0 / 0	3
	1550	P1623C Balanced Stone Heaps binary search greedy *1600	0 / 0	5
	1549	P1623D Robot Cleaner Revisit implementation math probabilities *2300	0 / 0	8
	1548	P1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	9
	1547	P1624A Plus One on the Subset math *800	0 / 0	3
	1546	P1624B Make AP implementation math *900	0 / 0	3
	1545	P1624C Division by Two and Permutation constructive algorithms flows graph matchings greedy math *1100	0 / 0	3
	1544	P1624D Palindromes Coloring binary search greedy sortings strings *1400	0 / 0	4
	1543	P1624E Masha-forgetful brute force constructive algorithms dp hashing implementation strings *2000	0 / 0	7
	1542	P1624F Interacdive Problem binary search constructive algorithms interactive *2000	0 / 0	7
	1541	P1624G MinOr Tree bitmasks dfs and similar dsu graphs greedy *1900	0 / 0	6
	1540	P1625A Ancient Civilization bitmasks greedy math *800	0 / 0	3
	1539	P1625B Elementary Particles brute force greedy sortings *1100	0 / 0	3
	1538	P1625C Road Optimization dp *1700	0 / 0	5
	1537	P1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	8
	1536	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	9
	1535	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	10
	1534	P1626A Equidistant Letters constructive algorithms sortings *800	0 / 0	3
	1533	P1626B Minor Reduction greedy strings *1100	0 / 0	3
	1532	P1626C Monsters And Spells binary search data structures dp greedy implementation math two pointers *1700	0 / 0	5
	1531	P1626D Martial Arts Tournament binary search brute force greedy math *2100	0 / 0	7
	1530	P1626E Black and White Tree dfs and similar greedy trees *2400	0 / 0	9
	1529	P1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	10
	1528	P1627A Not Shading constructive algorithms implementation *800	0 / 0	3
	1527	P1627B Not Sitting games greedy sortings *1300	0 / 0	4
	1526	P1627C Not Assigning constructive algorithms dfs and similar number theory trees *1400	0 / 0	4
	1525	P1627D Not Adding brute force dp math number theory *1900	0 / 0	6
	1524	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	8
	1523	P1627F Not Splitting geometry graphs greedy implementation shortest paths *2700	0 / 0	10
	1522	P1628A Meximum Array binary search constructive algorithms greedy implementation math two pointers *1400	0 / 0	4
	1521	P1628B Peculiar Movie Preferences greedy strings *1700	0 / 0	5
	1520	P1628C Grid Xor constructive algorithms greedy implementation interactive math *2300	0 / 0	8
	1519	P1628D1 Game on Sum (Easy Version) combinatorics dp games math *2100	0 / 0	7
	1518	P1628D2 Game on Sum (Hard Version) combinatorics dp games math *2400	0 / 0	9
	1517	P1628E Groceries in Meteor Town binary search data structures dsu trees *3100	0 / 0	10
	1516	P1628F Spaceship Crisis Management binary search data structures geometry sortings *3500	0 / 0	10
	1515	P1629A Download More RAM brute force greedy sortings *800	0 / 0	3
	1514	P1629B GCD Arrays greedy math number theory *800	0 / 0	3
	1513	P1630A And Matching bitmasks constructive algorithms *1500	0 / 0	5
	1512	P1630B Range and Partition binary search constructive algorithms data structures greedy two pointers *1800	0 / 0	6
	1511	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	8
	1510	P1630D Flipping Range constructive algorithms dp greedy number theory *2400	0 / 0	9
	1509	P1630E Expected Components combinatorics math number theory probabilities *2900	0 / 0	10
	1508	P1630F Making It Bipartite flows graph matchings graphs number theory *3400	0 / 0	10
	1507	P1631A Min Max Swap greedy *800	0 / 0	3
	1506	P1631B Fun with Even Subarrays dp greedy *1100	0 / 0	3
	1505	P1632A ABC implementation *800	0 / 0	3
	1504	P1632B Roof Construction bitmasks constructive algorithms *1000	0 / 0	3
	1503	P1632C Strange Test binary search bitmasks brute force dp math *1600	0 / 0	5
	1502	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	7
	1501	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	9
	1500	P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	10
	1499	P1633A Div brute force *800	0 / 0	3
	1498	P1633B Minority greedy *800	0 / 0	3
	1497	P1633C Kill the Monster brute force math *1100	0 / 0	3
	1496	P1633D Make Them Equal dp greedy *1600	0 / 0	5
	1495	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	9
	1494	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	10
	1493	P1634A Reverse and Concatenate greedy strings *800	0 / 0	3
	1492	P1634B Fortune Telling bitmasks math *1400	0 / 0	4
	1491	P1634C OKEA constructive algorithms *1000	0 / 0	3
	1490	P1634D Finding Zero constructive algorithms interactive math *2000	0 / 0	7
	1489	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	9
	1488	P1634F Fibonacci Additions brute force data structures hashing implementation math *2700	0 / 0	10
	1487	P1635A Min Or Sum bitmasks greedy *800	0 / 0	3
	1486	P1635B Avoid Local Maximums greedy *800	0 / 0	3
	1485	P1635C Differential Sorting constructive algorithms greedy *1200	0 / 0	4

Pick a problem randomly based on the current filter.