Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	884	P1741B Funny Permutation constructive algorithms math *800	0 / 0	3
	883	P1741C Minimize the Thickness brute force greedy math two pointers *1100	0 / 0	3
	882	P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees *1300	0 / 0	4
	881	P1741E Sending a Sequence Over the Network dp *1600	0 / 0	5
	880	P1741F Multi-Colored Segments binary search data structures math sortings *2000	0 / 0	7
	879	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	878	P1742A Sum implementation *800	0 / 0	3
	877	P1742B Increasing greedy implementation sortings *800	0 / 0	3
	876	P1742C Stripes implementation *900	0 / 0	3
	875	P1742D Coprime brute force greedy number theory *1100	0 / 0	3
	874	P1742E Scuza binary search greedy math *1200	0 / 0	4
	873	P1742F Smaller constructive algorithms greedy strings *1500	0 / 0	5
	872	P1742G Orray bitmasks brute force greedy math sortings *1500	0 / 0	5
	871	P1743A Password brute force combinatorics implementation math *800	0 / 0	3
	870	P1743B Permutation Value constructive algorithms greedy *800	0 / 0	3
	869	P1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	3
	868	P1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	5
	867	P1743E FTL binary search dp *2400	0 / 0	9
	866	P1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	8
	865	P1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp hashing math *3000	0 / 0	10
	864	P1744A Number Replacement greedy implementation *800	0 / 0	3
	863	P1744B Even-Odd Increments implementation math *800	0 / 0	3
	862	P1744C Traffic Light binary search implementation two pointers *1000	0 / 0	3
	861	P1744D Divisibility by 2^n greedy math sortings *1200	0 / 0	4
	860	P1744E1 Divisible Numbers (easy version) brute force math number theory *1500	0 / 0	5
	859	P1744E2 Divisible Numbers (hard version) brute force math number theory *1900	0 / 0	6
	858	P1744F MEX vs MED math two pointers *2000	0 / 0	7
	857	P1746A Maxmina constructive algorithms greedy *800	0 / 0	3
	856	P1746B Rebellion constructive algorithms greedy two pointers *800	0 / 0	3
	855	P1746C Permutation Operations constructive algorithms greedy implementation math *1300	0 / 0	4
	854	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	853	P1746E1 Joking (Easy Version) binary search constructive algorithms interactive ternary search *2500	0 / 0	9
	852	P1746E2 Joking (Hard Version) dp interactive *3200	0 / 0	10
	851	P1746F Kazaee data structures hashing probabilities *2800	0 / 0	10
	850	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	849	P1747A Two Groups constructive algorithms greedy *800	0 / 0	3
	848	P1747B BAN BAN constructive algorithms *900	0 / 0	3
	847	P1747C Swap Game games *1200	0 / 0	4
	846	P1747D Yet Another Problem binary search bitmasks constructive algorithms data structures *1900	0 / 0	6
	845	P1747E List Generation combinatorics dp math *2900	0 / 0	10
	844	P1748A The Ultimate Square math *800	0 / 0	3
	843	P1748B Diverse Substrings brute force implementation strings *1400	0 / 0	4
	842	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	5
	841	P1748D ConstructOR bitmasks chinese remainder theorem combinatorics constructive algorithms math number theory *2100	0 / 0	7
	840	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	839	P1748F Circular Xor Reversal bitmasks constructive algorithms *3000	0 / 0	10
	838	P1749A Cowardly Rooks greedy implementation *800	0 / 0	3
	837	P1749B Death's Blessing greedy *900	0 / 0	3
	836	P1749C Number Game binary search data structures games greedy implementation *1400	0 / 0	4
	835	P1749D Counting Arrays combinatorics dp math number theory *1900	0 / 0	6
	834	P1749E Cactus Wall constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	833	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	10
	832	P1750A Indirect Sort constructive algorithms implementation math *800	0 / 0	3
	831	P1750B Maximum Substring brute force greedy implementation *800	0 / 0	3
	830	P1750C Complementary XOR constructive algorithms implementation *1400	0 / 0	4
	829	P1750D Count GCD combinatorics math number theory *1800	0 / 0	6
	828	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	827	P1750F Majority combinatorics dp math strings *2700	0 / 0	10
	826	P1750G Doping combinatorics dp math *3300	0 / 0	10
	825	P1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	10
	824	P1753A1 Make Nonzero Sum (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	823	P1753A2 Make Nonzero Sum (hard version) constructive algorithms dp greedy *1500	0 / 0	5
	822	P1753B Factorial Divisibility math number theory *1600	0 / 0	5
	821	P1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	7
	820	P1753D The Beach constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	819	P1753E N Machines binary search brute force greedy *3300	0 / 0	10
	818	P1753F Minecraft Series brute force two pointers *3500	0 / 0	10
	817	P1754A Technical Support greedy *800	0 / 0	3
	816	P1754B Kevin and Permutation constructive algorithms greedy math *800	0 / 0	3
	815	P1758A SSeeeeiinngg DDoouubbllee constructive algorithms strings *800	0 / 0	3
	814	P1758B XOR = Average constructive algorithms *900	0 / 0	3
	813	P1758C Almost All Multiples greedy number theory *1400	0 / 0	4
	812	P1758D Range = √Sum binary search brute force constructive algorithms math two pointers *1800	0 / 0	6
	811	P1758E Tick, Tock combinatorics dfs and similar dsu graphs *2500	0 / 0	9
	810	P1758F Decent Division constructive algorithms data structures *3000	0 / 0	10
	809	P1759A Yes-Yes? implementation strings *800	0 / 0	3
	808	P1759B Lost Permutation math *800	0 / 0	3
	807	P1759C Thermostat greedy math shortest paths *1100	0 / 0	3
	806	P1759D Make It Round brute force number theory *1400	0 / 0	4
	805	P1759E The Humanoid brute force dp sortings *1500	0 / 0	5
	804	P1759F All Possible Digits binary search data structures greedy math number theory *1800	0 / 0	6
	803	P1759G Restore the Permutation binary search constructive algorithms data structures greedy math *1900	0 / 0	6
	802	P1760A Medium Number implementation sortings *800	0 / 0	3
	801	P1760B Atilla's Favorite Problem greedy implementation strings *800	0 / 0	3
	800	P1760C Advantage data structures implementation sortings *800	0 / 0	3
	799	P1760D Challenging Valleys implementation two pointers *1000	0 / 0	3
	798	P1760E Binary Inversions data structures greedy math *1100	0 / 0	3
	797	P1760F Quests binary search greedy sortings *1500	0 / 0	5
	796	P1760G SlavicG's Favorite Problem bitmasks dfs and similar graphs *1700	0 / 0	5
	795	P1761A Two Permutations brute force constructive algorithms *800	0 / 0	3
	794	P1761B Elimination of a Ring constructive algorithms greedy implementation *1000	0 / 0	3
	793	P1761C Set Construction constructive algorithms dfs and similar graphs greedy *1400	0 / 0	4
	792	P1761D Carry Bit combinatorics math *2100	0 / 0	7
	791	P1761E Make It Connected binary search brute force constructive algorithms dsu graphs greedy matrices trees two pointers *2400	0 / 0	9
	790	P1761F1 Anti-median (Easy Version) dp math *3100	0 / 0	10
	789	P1761F2 Anti-median (Hard Version) combinatorics dp math *3500	0 / 0	10
	788	P1761G Centroid Guess interactive probabilities trees *3500	0 / 0	10
	787	P1762A Divide and Conquer greedy math number theory *800	0 / 0	3
	786	P1762B Make Array Good constructive algorithms implementation number theory sortings *1100	0 / 0	3
	785	P1762C Binary Strings are Fun combinatorics math *1400	0 / 0	4

Pick a problem randomly based on the current filter.