Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	756	codeforces#P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	755	codeforces#P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	754	codeforces#P1765K Torus Path greedy math *1500	0 / 0	5
	753	codeforces#P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	752	codeforces#P1765M Minimum LCM math number theory *1000	0 / 0	3
	751	codeforces#P1765N Number Reduction greedy *1500	0 / 0	5
	750	codeforces#P1766A Extremely Round brute force implementation *800	0 / 0	3
	749	codeforces#P1766B Notepad# implementation *1000	0 / 0	3
	748	codeforces#P1766C Hamiltonian Wall dp implementation *1300	0 / 0	4
	747	codeforces#P1766D Lucky Chains math number theory *1600	0 / 0	5
	746	codeforces#P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	745	codeforces#P1766F MCF flows *2800	0 / 0	10
	744	codeforces#P1767A Cut the Triangle implementation *800	0 / 0	3
	743	codeforces#P1767B Block Towers data structures greedy sortings *800	0 / 0	3
	742	codeforces#P1767C Count Binary Strings data structures dp *2100	0 / 0	7
	741	codeforces#P1767D Playoff combinatorics constructive algorithms dp greedy math *1500	0 / 0	5
	740	codeforces#P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	739	codeforces#P1767F Two Subtrees data structures trees *3100	0 / 0	10
	738	codeforces#P1768A Greatest Convex greedy math number theory *800	0 / 0	3
	737	codeforces#P1768B Quick Sort greedy math *900	0 / 0	3
	736	codeforces#P1768C Elemental Decompress constructive algorithms greedy implementation sortings *1300	0 / 0	4
	735	codeforces#P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy *1800	0 / 0	6
	734	codeforces#P1768E Partial Sorting combinatorics math number theory *2300	0 / 0	8
	733	codeforces#P1768F Wonderful Jump dp greedy *2900	0 / 0	10
	732	codeforces#P1770A Koxia and Whiteboards brute force greedy *1000	0 / 0	3
	731	codeforces#P1770B Koxia and Permutation constructive algorithms *1000	0 / 0	3
	730	codeforces#P1770C Koxia and Number Theory brute force chinese remainder theorem math number theory *1700	0 / 0	5
	729	codeforces#P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	728	codeforces#P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	9
	727	codeforces#P1770F Koxia and Sequence bitmasks combinatorics dp math number theory *3100	0 / 0	10
	726	codeforces#P1770G Koxia and Bracket divide and conquer fft math *3400	0 / 0	10
	725	codeforces#P1770H Koxia, Mahiru and Winter Festival constructive algorithms *3500	0 / 0	10
	724	codeforces#P1771A Hossam and Combinatorics combinatorics math sortings *900	0 / 0	3
	723	codeforces#P1771B Hossam and Friends binary search constructive algorithms dp two pointers *1400	0 / 0	4
	722	codeforces#P1771C Hossam and Trainees greedy math number theory *1600	0 / 0	5
	721	codeforces#P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	720	codeforces#P1771E Hossam and a Letter brute force dp implementation two pointers *2500	0 / 0	9
	719	codeforces#P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	718	codeforces#P1773A Amazing Trick constructive algorithms graph matchings math probabilities *1900	0 / 0	6
	717	codeforces#P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	716	codeforces#P1773C __NO_TITLE__	0 / 0	(None)
	715	codeforces#P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	714	codeforces#P1773E Easy Assembly greedy sortings *1400	0 / 0	4
	713	codeforces#P1773F Football constructive algorithms *800	0 / 0	3
	712	codeforces#P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	711	codeforces#P1773H Hot and Cold binary search interactive *2600	0 / 0	10
	710	codeforces#P1773I Interactive Factorial Guessing brute force games implementation interactive *2500	0 / 0	9
	709	codeforces#P1773J Jumbled Trees constructive algorithms math *2900	0 / 0	10
	708	codeforces#P1773K __NO_TITLE__	0 / 0	(None)
	707	codeforces#P1773L Lisa's Sequences dp *3500	0 / 0	10
	706	codeforces#P1774A Add Plus Minus Sign constructive algorithms math *800	0 / 0	3
	705	codeforces#P1774B Coloring constructive algorithms greedy math *1500	0 / 0	5
	704	codeforces#P1774C Ice and Fire constructive algorithms dp greedy *1300	0 / 0	4
	703	codeforces#P1774D Same Count One brute force constructive algorithms greedy implementation two pointers *1600	0 / 0	5
	702	codeforces#P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	701	codeforces#P1774F1 Magician and Pigs (Easy Version) brute force data structures implementation *2400	0 / 0	9
	700	codeforces#P1774F2 Magician and Pigs (Hard Version) binary search brute force data structures implementation *2700	0 / 0	10
	699	codeforces#P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	698	codeforces#P1774H Maximum Permutation constructive algorithms *3500	0 / 0	10
	697	codeforces#P1775A1 Gardener and the Capybaras (easy version) brute force constructive algorithms implementation *800	0 / 0	3
	696	codeforces#P1775A2 Gardener and the Capybaras (hard version) constructive algorithms greedy *900	0 / 0	3
	695	codeforces#P1775B Gardener and the Array bitmasks constructive algorithms *1300	0 / 0	4
	694	codeforces#P1775C Interesting Sequence bitmasks math *1600	0 / 0	5
	693	codeforces#P1775D Friendly Spiders dfs and similar graphs math number theory shortest paths *1800	0 / 0	6
	692	codeforces#P1775E The Human Equation greedy implementation *2100	0 / 0	7
	691	codeforces#P1775F Laboratory on Pluto constructive algorithms dp greedy math *2500	0 / 0	9
	690	codeforces#P1776A Walking Boy greedy *800	0 / 0	3
	689	codeforces#P1776B Vittorio Plays with LEGO Bricks dp geometry *2200	0 / 0	8
	688	codeforces#P1776C Library game games greedy interactive sortings *2500	0 / 0	9
	687	codeforces#P1776D Teamwork constructive algorithms greedy math *2800	0 / 0	10
	686	codeforces#P1776E Crossing the Railways data structures dp *3500	0 / 0	10
	685	codeforces#P1776F Train Splitting constructive algorithms graphs greedy *1700	0 / 0	5
	684	codeforces#P1776G Another Wine Tasting Event combinatorics constructive algorithms math strings *2100	0 / 0	7
	683	codeforces#P1776H Beppa and SwerChat two pointers *1300	0 / 0	4
	682	codeforces#P1776I Spinach Pizza games geometry greedy interactive *2500	0 / 0	9
	681	codeforces#P1776J Italian Data Centers graphs shortest paths *2500	0 / 0	9
	680	codeforces#P1776K Uniform Chemistry dp math *3200	0 / 0	10
	679	codeforces#P1776L Controllers binary search math *1500	0 / 0	5
	678	codeforces#P1776M Parmigiana With Seafood binary search dp greedy trees *3000	0 / 0	10
	677	codeforces#P1776N Count Permutations math *3500	0 / 0	10
	676	codeforces#P1777A Everybody Likes Good Arrays! greedy math *800	0 / 0	3
	675	codeforces#P1777B Emordnilap combinatorics greedy math *900	0 / 0	3
	674	codeforces#P1777C Quiz Master binary search math number theory sortings two pointers *1700	0 / 0	5
	673	codeforces#P1777D Score of a Tree bitmasks combinatorics dfs and similar dp math probabilities trees *1900	0 / 0	6
	672	codeforces#P1777E Edge Reverse binary search dfs and similar graphs trees *2200	0 / 0	8
	671	codeforces#P1777F Comfortably Numb bitmasks data structures divide and conquer strings trees *2400	0 / 0	9
	670	codeforces#P1778A Flip Flop Sum greedy implementation *800	0 / 0	3
	669	codeforces#P1778B The Forbidden Permutation greedy math *1300	0 / 0	4
	668	codeforces#P1778C Flexible String bitmasks brute force strings *1600	0 / 0	5
	667	codeforces#P1778D Flexible String Revisit combinatorics dp math probabilities *2100	0 / 0	7
	666	codeforces#P1778E The Tree Has Fallen! bitmasks dfs and similar math trees *2500	0 / 0	9
	665	codeforces#P1778F Maximizing Root dfs and similar dp graphs math number theory trees *2600	0 / 0	10
	664	codeforces#P1779A Hall of Fame constructive algorithms greedy strings *800	0 / 0	3
	663	codeforces#P1779B MKnez's ConstructiveForces Task constructive algorithms math *900	0 / 0	3
	662	codeforces#P1779C Least Prefix Sum data structures greedy *1600	0 / 0	5
	661	codeforces#P1779D Boris and His Amazing Haircut constructive algorithms data structures dp dsu greedy sortings *1700	0 / 0	5
	660	codeforces#P1779E Anya's Simultaneous Exhibition constructive algorithms graphs greedy interactive sortings *2400	0 / 0	9
	659	codeforces#P1779F Xorcerer's Stones bitmasks constructive algorithms dp trees *2500	0 / 0	9
	658	codeforces#P1779G The Game of the Century constructive algorithms graphs shortest paths *3000	0 / 0	10
	657	codeforces#P1779H Olympic Team Building brute force meet-in-the-middle *3500	0 / 0	10

Pick a problem randomly based on the current filter.