Problem Set - *2100 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2475	P1450C1 Errich-Tac-Toe (Easy Version) constructive algorithms math *2100	0 / 0	7
	2442	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2400	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2358	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	2357	P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	7
	2318	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2302	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	2288	P1486D Max Median binary search data structures dp *2100	0 / 0	7
	2244	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	0 / 0	7
	2211	P1499D The Number of Pairs dp math number theory *2100	0 / 0	7
	2163	P1510D Digits dp math number theory *2100	0 / 0	7
	2151	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	2118	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	2077	P1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	0 / 0	7
	2050	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	1998	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	1996	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	1954	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	7
	1934	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	7
	1918	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	1904	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	7
	1871	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	7
	1804	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	7
	1727	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	1714	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	7
	1704	P1599H Hidden Fortress interactive math *2100	0 / 0	7
	1679	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	7
	1672	P1606E Arena combinatorics dp math *2100	0 / 0	7
	1614	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	7
	1564	P1621D The Winter Hike constructive algorithms greedy math *2100	0 / 0	7
	1531	P1626D Martial Arts Tournament binary search brute force greedy math *2100	0 / 0	7
	1519	P1628D1 Game on Sum (Easy Version) combinatorics dp games math *2100	0 / 0	7
	1477	P1637E Best Pair binary search brute force implementation *2100	0 / 0	7
	1416	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	7
	1406	P1654D Potion Brewing Class dfs and similar math number theory trees *2100	0 / 0	7
	1367	P1660F2 Promising String (hard version) data structures implementation math strings *2100	0 / 0	7
	1323	P1666J Job Lookup constructive algorithms dp shortest paths trees *2100	0 / 0	7
	1319	P1667B Optimal Partition data structures dp *2100	0 / 0	7
	1294	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	7
	1216	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	7
	1066	P1710B Rain binary search brute force data structures geometry greedy implementation math *2100	0 / 0	7
	988	P1725F Field Photography bitmasks data structures sortings *2100	0 / 0	7
	959	P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	943	P1732C2 Sheikh (Hard Version) binary search bitmasks brute force greedy implementation two pointers *2100	0 / 0	7
	929	P1734E Rectangular Congruence constructive algorithms number theory *2100	0 / 0	7
	841	P1748D ConstructOR bitmasks chinese remainder theorem combinatorics constructive algorithms math number theory *2100	0 / 0	7
	792	P1761D Carry Bit combinatorics math *2100	0 / 0	7
	784	P1762D GCD Queries constructive algorithms interactive number theory *2100	0 / 0	7
	742	P1767C Count Binary Strings data structures dp *2100	0 / 0	7
	721	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	692	P1775E The Human Equation greedy implementation *2100	0 / 0	7
	684	P1776G Another Wine Tasting Event combinatorics constructive algorithms math strings *2100	0 / 0	7
	667	P1778D Flexible String Revisit combinatorics dp math probabilities *2100	0 / 0	7
	621	P1787E The Harmonization of XOR bitmasks constructive algorithms greedy math *2100	0 / 0	7
	599	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	542	P1799D2 Hot Start Up (hard version) data structures dp *2100	0 / 0	7
	525	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	486	P1808D Petya, Petya, Petr, and Palindromes binary search brute force data structures two pointers *2100	0 / 0	7
	471	P1810E Monsters brute force data structures dfs and similar dsu graphs greedy *2100	0 / 0	7
	462	P1811F Is It Flower? dfs and similar graphs implementation *2100	0 / 0	7
	461	P1811G1 Vlad and the Nice Paths (easy version) combinatorics dp math *2100	0 / 0	7
	415	P1821E Rearrange Brackets brute force dp greedy sortings strings *2100	0 / 0	7
	357	P1832D1 Red-Blue Operations (Easy Version) binary search greedy implementation math *2100	0 / 0	7
	323	P1838D Bracket Walk data structures greedy strings *2100	0 / 0	7
	317	P1839D Ball Sorting data structures dp sortings *2100	0 / 0	7
	209	P1856D More Wrong divide and conquer interactive *2100	0 / 0	7
	164	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	7
	155	P1864E Guess Game bitmasks data structures games math probabilities sortings strings trees *2100	0 / 0	7
	144	P1866G Grouped Carriages binary search data structures dp flows greedy *2100	0 / 0	7
	143	P1866H Happy Sets combinatorics *2100	0 / 0	7
	128	P1868B2 Candy Party (Hard Version) bitmasks constructive algorithms dp greedy implementation math *2100	0 / 0	7
	86	P1876C Autosynthesis constructive algorithms dfs and similar graphs greedy sortings *2100	0 / 0	7
	42	P1884D Counting Rhyme dp math number theory *2100	0 / 0	7
	37	P1886D Monocarp and the Set combinatorics data structures math *2100	0 / 0	7
	5345	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	0 / 0	7
	6610	P1906J Count BFS Graph combinatorics dp *2100	0 / 0	7
	6683	P1910E Maximum Sum Subarrays special problem dp 2100	0 / 0	7
	6662	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	6652	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	7322	P1919D 01 Tree constructive algorithms data structures divide and conquer dp dsu greedy implementation sortings trees *2100	0 / 0	7
	8196	P1920E Counting Binary Strings combinatorics dp math *2100	0 / 0	7
	8179	P1924B Space Harbour data structures implementation math sortings *2100	0 / 0	7
	9343	P1970B2 Exact Neighbours (Medium) constructive algorithms *2100	0 / 0	7
	9338	P1970D1 Arithmancy (Easy) brute force constructive algorithms interactive strings *2100	0 / 0	7
	9319	P1971H ±1 2-sat dfs and similar graphs *2100	0 / 0	7

Pick a problem randomly based on the current filter.