Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	784	P1762D GCD Queries constructive algorithms interactive number theory *2100	0 / 0	7
	783	P1762E Tree Sum combinatorics math trees *2600	0 / 0	10
	782	P1762F Good Pairs binary search data structures dp *2600	0 / 0	10
	781	P1762G Unequal Adjacent Elements constructive algorithms sortings *3100	0 / 0	10
	780	P1763A Absolute Maximization bitmasks constructive algorithms greedy math *800	0 / 0	3
	779	P1763B Incinerate binary search brute force data structures implementation math sortings *1200	0 / 0	4
	778	P1763C Another Array Problem brute force constructive algorithms greedy *2000	0 / 0	7
	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
	775	P1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	10
	774	P1764A Doremy's Paint greedy *800	0 / 0	3
	773	P1764B Doremy's Perfect Math Class math number theory *900	0 / 0	3
	772	P1764C Doremy's City Construction graphs greedy *1400	0 / 0	4
	771	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	770	P1764E Doremy's Number Line dp greedy sortings *2400	0 / 0	9
	769	P1764F Doremy's Experimental Tree brute force constructive algorithms dfs and similar dsu sortings trees *2500	0 / 0	9
	768	P1764G1 Doremy's Perfect DS Class (Easy Version) binary search interactive *2900	0 / 0	10
	767	P1764G2 Doremy's Perfect DS Class (Medium Version) binary search interactive *3000	0 / 0	10
	766	P1764G3 Doremy's Perfect DS Class (Hard Version) binary search interactive *3300	0 / 0	10
	765	P1764H Doremy's Paint 2 data structures *3400	0 / 0	10
	764	P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	9
	763	P1765B Broken Keyboard greedy *800	0 / 0	3
	762	P1765C Card Guessing combinatorics dp probabilities *2600	0 / 0	10
	761	P1765D Watch the Videos binary search constructive algorithms two pointers *1700	0 / 0	5
	760	P1765E Exchange brute force math *1000	0 / 0	3
	759	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	758	P1765G Guess the String constructive algorithms interactive probabilities *2600	0 / 0	10
	757	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	756	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	755	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	754	P1765K Torus Path greedy math *1500	0 / 0	5
	753	P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	752	P1765M Minimum LCM math number theory *1000	0 / 0	3
	751	P1765N Number Reduction greedy *1500	0 / 0	5
	750	P1766A Extremely Round brute force implementation *800	0 / 0	3
	749	P1766B Notepad# implementation *1000	0 / 0	3
	748	P1766C Hamiltonian Wall dp implementation *1300	0 / 0	4
	747	P1766D Lucky Chains math number theory *1600	0 / 0	5
	746	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	745	P1766F MCF flows *2800	0 / 0	10
	744	P1767A Cut the Triangle implementation *800	0 / 0	3
	743	P1767B Block Towers data structures greedy sortings *800	0 / 0	3
	742	P1767C Count Binary Strings data structures dp *2100	0 / 0	7
	741	P1767D Playoff combinatorics constructive algorithms dp greedy math *1500	0 / 0	5
	740	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	739	P1767F Two Subtrees data structures trees *3100	0 / 0	10
	738	P1768A Greatest Convex greedy math number theory *800	0 / 0	3
	737	P1768B Quick Sort greedy math *900	0 / 0	3
	736	P1768C Elemental Decompress constructive algorithms greedy implementation sortings *1300	0 / 0	4
	735	P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy *1800	0 / 0	6
	734	P1768E Partial Sorting combinatorics math number theory *2300	0 / 0	8
	733	P1768F Wonderful Jump dp greedy *2900	0 / 0	10
	732	P1770A Koxia and Whiteboards brute force greedy *1000	0 / 0	3
	731	P1770B Koxia and Permutation constructive algorithms *1000	0 / 0	3
	730	P1770C Koxia and Number Theory brute force chinese remainder theorem math number theory *1700	0 / 0	5
	729	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	728	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	9
	727	P1770F Koxia and Sequence bitmasks combinatorics dp math number theory *3100	0 / 0	10
	726	P1770G Koxia and Bracket divide and conquer fft math *3400	0 / 0	10
	725	P1770H Koxia, Mahiru and Winter Festival constructive algorithms *3500	0 / 0	10
	724	P1771A Hossam and Combinatorics combinatorics math sortings *900	0 / 0	3
	723	P1771B Hossam and Friends binary search constructive algorithms dp two pointers *1400	0 / 0	4
	722	P1771C Hossam and Trainees greedy math number theory *1600	0 / 0	5
	721	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	720	P1771E Hossam and a Letter brute force dp implementation two pointers *2500	0 / 0	9
	719	P1771F Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees *2500	0 / 0	9
	718	P1773A Amazing Trick constructive algorithms graph matchings math probabilities *1900	0 / 0	6
	717	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	716	P1773C __NO_TITLE__	0 / 0	(None)
	715	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	714	P1773E Easy Assembly greedy sortings *1400	0 / 0	4
	713	P1773F Football constructive algorithms *800	0 / 0	3
	712	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	711	P1773H Hot and Cold binary search interactive *2600	0 / 0	10
	710	P1773I Interactive Factorial Guessing brute force games implementation interactive *2500	0 / 0	9
	709	P1773J Jumbled Trees constructive algorithms math *2900	0 / 0	10
	708	P1773K __NO_TITLE__	0 / 0	(None)
	707	P1773L Lisa's Sequences dp *3500	0 / 0	10
	706	P1774A Add Plus Minus Sign constructive algorithms math *800	0 / 0	3
	705	P1774B Coloring constructive algorithms greedy math *1500	0 / 0	5
	704	P1774C Ice and Fire constructive algorithms dp greedy *1300	0 / 0	4
	703	P1774D Same Count One brute force constructive algorithms greedy implementation two pointers *1600	0 / 0	5
	702	P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	701	P1774F1 Magician and Pigs (Easy Version) brute force data structures implementation *2400	0 / 0	9
	700	P1774F2 Magician and Pigs (Hard Version) binary search brute force data structures implementation *2700	0 / 0	10
	699	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	698	P1774H Maximum Permutation constructive algorithms *3500	0 / 0	10
	697	P1775A1 Gardener and the Capybaras (easy version) brute force constructive algorithms implementation *800	0 / 0	3
	696	P1775A2 Gardener and the Capybaras (hard version) constructive algorithms greedy *900	0 / 0	3
	695	P1775B Gardener and the Array bitmasks constructive algorithms *1300	0 / 0	4
	694	P1775C Interesting Sequence bitmasks math *1600	0 / 0	5
	693	P1775D Friendly Spiders dfs and similar graphs math number theory shortest paths *1800	0 / 0	6
	692	P1775E The Human Equation greedy implementation *2100	0 / 0	7
	691	P1775F Laboratory on Pluto constructive algorithms dp greedy math *2500	0 / 0	9
	690	P1776A Walking Boy greedy *800	0 / 0	3
	689	P1776B Vittorio Plays with LEGO Bricks dp geometry *2200	0 / 0	8
	688	P1776C Library game games greedy interactive sortings *2500	0 / 0	9
	687	P1776D Teamwork constructive algorithms greedy math *2800	0 / 0	10
	686	P1776E Crossing the Railways data structures dp *3500	0 / 0	10
	685	P1776F Train Splitting constructive algorithms graphs greedy *1700	0 / 0	5

Pick a problem randomly based on the current filter.