Problem Set - *2000 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3263	P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	7
	3251	P1296E2 String Coloring (hard version) data structures dp *2000	0 / 0	7
	3230	P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	7
	3206	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	3179	P1311D Three Integers brute force math *2000	0 / 0	7
	3157	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	7
	3152	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	3025	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	7
	3013	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	7
	3002	P1349B Orac and Medians constructive algorithms greedy math *2000	0 / 0	7
	3001	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	2975	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
	2927	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	2926	P1359E Modular Stability combinatorics math number theory *2000	0 / 0	7
	2903	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	2886	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	7
	2857	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	2815	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	2807	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	2782	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	7
	2769	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	2757	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	2714	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	2672	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2644	P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	7
	2640	P1416B Make Them Equal constructive algorithms greedy math *2000	0 / 0	7
	2639	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2573	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	2570	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	7
	2569	P1427D Unshuffling a Deck constructive algorithms implementation *2000	0 / 0	7
	2544	P1431E Chess Match special problem 2000	0 / 0	7
	2515	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	0 / 0	7
	2463	P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	7
	2443	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	7
	2432	P1458B Glass Half Spilled dp *2000	0 / 0	7
	2309	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	7
	2281	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2245	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2177	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	2176	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2138	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	2132	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2092	P1521C Nastia and a Hidden Permutation constructive algorithms interactive *2000	0 / 0	7
	2079	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2012	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	1933	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	1887	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	7
	1855	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	7
	1848	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	7
	1834	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	7
	1818	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	1768	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	7
	1753	P1584D Guess the Permutation binary search combinatorics interactive math *2000	0 / 0	7
	1709	P1599C Bubble Strike combinatorics math probabilities ternary search *2000	0 / 0	7
	1644	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	1626	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	1619	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	7
	1600	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	1584	P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	7
	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
	1571	P1620D Exact Change brute force constructive algorithms greedy *2000	0 / 0	7
	1555	P1622D Shuffle combinatorics math two pointers *2000	0 / 0	7
	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
	1502	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	7
	1490	P1634D Finding Zero constructive algorithms interactive math *2000	0 / 0	7
	1470	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	7
	1455	P1641B Repetitions Decoding constructive algorithms implementation sortings *2000	0 / 0	7
	1439	P1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	7
	1389	P1657D For Gamers binary search brute force greedy math sortings *2000	0 / 0	7
	1334	P1665D GCD Guess bitmasks chinese remainder theorem constructive algorithms games interactive math number theory *2000	0 / 0	7
	1287	P1672F1 Array Shuffling constructive algorithms graphs greedy *2000	0 / 0	7
	1272	P1674E Breaking the Wall binary search brute force constructive algorithms greedy math *2000	0 / 0	7
	1270	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	7
	1234	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	1223	P1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	7
	1211	P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	7
	1184	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1151	P1696E Placing Jinas combinatorics math *2000	0 / 0	7
	1110	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	7
	1057	P1712D Empty Graph binary search constructive algorithms data structures greedy shortest paths *2000	0 / 0	7
	1032	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	1031	P1716D Chip Move brute force dp math *2000	0 / 0	7
	1020	P1718B Fibonacci Strings greedy implementation math number theory *2000	0 / 0	7
	991	P1725C Circular Mirror binary search combinatorics geometry math two pointers *2000	0 / 0	7
	977	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	948	P1731E Graph Cost dp greedy math number theory *2000	0 / 0	7
	935	P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	7
	880	P1741F Multi-Colored Segments binary search data structures math sortings *2000	0 / 0	7
	858	P1744F MEX vs MED math two pointers *2000	0 / 0	7
	821	P1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	7
	778	P1763C Another Array Problem brute force constructive algorithms greedy *2000	0 / 0	7
	771	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	729	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	638	P1783D Different Arrays brute force dp implementation *2000	0 / 0	7
	613	P1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	7
	561	P1796D Maximum Subarray data structures dp greedy two pointers *2000	0 / 0	7
	516	P1804D Accommodation brute force dp greedy implementation *2000	0 / 0	7
	442	P1815B Sum Graph brute force constructive algorithms graphs implementation interactive shortest paths trees *2000	0 / 0	7

Pick a problem randomly based on the current filter.