Problem Set - *2200 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2346	P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	2327	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	8
	2295	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	8
	2287	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2274	P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	8
	2217	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	8
	2216	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	2206	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	8
	2197	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2186	P1505F Math special problem math 2200	0 / 0	8
	2183	P1505I Mysterious language again, seriously? special problem 2200	0 / 0	8
	2126	P1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	8
	2096	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	2095	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	2071	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	2017	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2004	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2003	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	1978	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	8
	1971	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	8
	1932	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	1926	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1898	P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	1891	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	1878	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	8
	1863	P1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	8
	1847	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	8
	1809	P1575G GCD Festival math number theory *2200	0 / 0	8
	1808	P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	8
	1805	P1575K Knitting Batik implementation math *2200	0 / 0	8
	1781	P1579G Minimal Coverage dp *2200	0 / 0	8
	1778	P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	8
	1760	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1726	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	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
	1608	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	1599	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	1583	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	8
	1554	P1622E Math Test bitmasks brute force greedy *2200	0 / 0	8
	1524	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	8
	1511	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	8
	1483	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	8
	1454	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	8
	1438	P1646E Power Board brute force dp math number theory *2200	0 / 0	8
	1417	P1650F Vitaly and Advanced Useless Algorithms dp greedy implementation *2200	0 / 0	8
	1397	P1656E Equal Tree Sums constructive algorithms dfs and similar math trees *2200	0 / 0	8
	1388	P1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	8
	1375	P1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	8
	1327	P1666F Fancy Stack combinatorics dp implementation *2200	0 / 0	8
	1324	P1666I Interactive Treasure Hunt brute force constructive algorithms geometry interactive math *2200	0 / 0	8
	1300	P1670E Hemose on the Tree bitmasks constructive algorithms dfs and similar trees *2200	0 / 0	8
	1288	P1672E notepad.exe binary search constructive algorithms greedy interactive *2200	0 / 0	8
	1158	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	1098	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	1024	P1717E Madoka and The Best University math number theory *2200	0 / 0	8
	1002	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	955	P1730D Prefixes and Suffixes constructive algorithms strings two pointers *2200	0 / 0	8
	917	P1736D Equal Binary Subsequences constructive algorithms geometry greedy implementation strings *2200	0 / 0	8
	912	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	879	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	777	P1763D Valid Bitonic Permutations combinatorics dp implementation math number theory *2200	0 / 0	8
	776	P1763E Node Pairs dp graphs math number theory *2200	0 / 0	8
	759	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	757	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	717	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	689	P1776B Vittorio Plays with LEGO Bricks dp geometry *2200	0 / 0	8
	672	P1777E Edge Reverse binary search dfs and similar graphs trees *2200	0 / 0	8
	632	P1784C Monsters (hard version) data structures greedy *2200	0 / 0	8
	612	P1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	8
	607	P1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation *2200	0 / 0	8
	567	P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	529	P1800G Symmetree dfs and similar hashing implementation trees *2200	0 / 0	8
	500	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	485	P1808E1 Minibuses on Venus (easy version) combinatorics divide and conquer dp *2200	0 / 0	8
	460	P1811G2 Vlad and the Nice Paths (hard version) binary search combinatorics data structures dp math two pointers *2200	0 / 0	8
	441	P1815C Between constructive algorithms dfs and similar graphs greedy *2200	0 / 0	8
	406	P1822G2 Magic Triples (Hard Version) brute force data structures math number theory *2200	0 / 0	8
	355	P1832E Combinatorics Problem brute force combinatorics dp *2200	0 / 0	8
	328	P1837E Playoff Fixing combinatorics trees *2200	0 / 0	8
	310	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
	309	P1840G1 In Search of Truth (Easy Version) constructive algorithms interactive math meet-in-the-middle probabilities *2200	0 / 0	8
	303	P1841E Fill the Matrix data structures greedy math *2200	0 / 0	8
	253	P1848D Vika and Bonuses binary search brute force math ternary search *2200	0 / 0	8
	219	P1854B Earn or Unlock bitmasks brute force dp *2200	0 / 0	8
	196	P1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	8
	184	P1860D Balanced String dp *2200	0 / 0	8
	132	P1867E2 Salyg1n and Array (hard version) constructive algorithms interactive *2200	0 / 0	8
	5135	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	6612	P1906H Twin Friends combinatorics dp *2200	0 / 0	8
	6600	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	6692	P1909F1 Small Permutation Problem (Easy Version) brute force combinatorics dp math *2200	0 / 0	8
	6673	P1912E Evaluate It and Back Again constructive algorithms implementation math *2200	0 / 0	8
	8203	P1918E ace5 and Task Order constructive algorithms divide and conquer implementation interactive math probabilities sortings *2200	0 / 0	8
	8187	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	9367	P1967B2 Reverse Card (Hard Version) brute force math number theory *2200	0 / 0	8
	9354	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	9333	P1970E3 Trails (Hard) dp matrices *2200	0 / 0	8
	9328	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8

Pick a problem randomly based on the current filter.