Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	956	codeforces#P1730C Minimum Notation data structures greedy math sortings *1200	0 / 0	4
	955	codeforces#P1730D Prefixes and Suffixes constructive algorithms strings two pointers *2200	0 / 0	8
	954	codeforces#P1730E Maximums and Minimums combinatorics data structures divide and conquer number theory *2700	0 / 0	10
	953	codeforces#P1730F Almost Sorted bitmasks data structures dp *2700	0 / 0	10
	952	codeforces#P1731A Joey Takes Money greedy math *800	0 / 0	3
	951	codeforces#P1731B Kill Demodogs greedy math *1100	0 / 0	3
	950	codeforces#P1731C Even Subarrays bitmasks brute force hashing math number theory *1700	0 / 0	5
	949	codeforces#P1731D Valiant's New Map binary search brute force data structures dp two pointers *1700	0 / 0	5
	948	codeforces#P1731E Graph Cost dp greedy math number theory *2000	0 / 0	7
	947	codeforces#P1731F Function Sum brute force combinatorics dp fft math *2500	0 / 0	9
	946	codeforces#P1732A Bestie brute force combinatorics constructive algorithms implementation math number theory *1000	0 / 0	3
	945	codeforces#P1732B Ugu brute force dp greedy implementation *900	0 / 0	3
	944	codeforces#P1732C1 Sheikh (Easy version) binary search bitmasks greedy two pointers *1800	0 / 0	6
	943	codeforces#P1732C2 Sheikh (Hard Version) binary search bitmasks brute force greedy implementation two pointers *2100	0 / 0	7
	942	codeforces#P1732D1 Balance (Easy version) brute force data structures implementation number theory *1500	0 / 0	5
	941	codeforces#P1732D2 Balance (Hard version) brute force data structures number theory *2400	0 / 0	9
	940	codeforces#P1732E Location data structures dp math number theory *2800	0 / 0	10
	939	codeforces#P1733A Consecutive Sum greedy sortings *800	0 / 0	3
	938	codeforces#P1733B Rule of League constructive algorithms math *900	0 / 0	3
	937	codeforces#P1733C Parity Shuffle Sorting constructive algorithms sortings *1300	0 / 0	4
	936	codeforces#P1733D1 Zero-One (Easy Version) constructive algorithms greedy math *1400	0 / 0	4
	935	codeforces#P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	7
	934	codeforces#P1733E Conveyor constructive algorithms dp math *2700	0 / 0	10
	933	codeforces#P1734A Select Three Sticks brute force greedy sortings *800	0 / 0	3
	932	codeforces#P1734B Bright, Nice, Brilliant constructive algorithms *800	0 / 0	3
	931	codeforces#P1734C Removing Smallest Multiples greedy math *1200	0 / 0	4
	930	codeforces#P1734D Slime Escape data structures dp greedy two pointers *1800	0 / 0	6
	929	codeforces#P1734E Rectangular Congruence constructive algorithms number theory *2100	0 / 0	7
	928	codeforces#P1734F Zeros and Ones bitmasks divide and conquer dp math *2500	0 / 0	9
	927	codeforces#P1735A Working Week constructive algorithms greedy math *800	0 / 0	3
	926	codeforces#P1735B Tea with Tangerines greedy math *900	0 / 0	3
	925	codeforces#P1735C Phase Shift dfs and similar dsu graphs greedy implementation strings *1400	0 / 0	4
	924	codeforces#P1735D Meta-set brute force combinatorics data structures hashing math *1700	0 / 0	5
	923	codeforces#P1735E House Planning constructive algorithms data structures graph matchings greedy *2400	0 / 0	9
	922	codeforces#P1735F Pebbles and Beads data structures geometry *2900	0 / 0	10
	921	codeforces#P1736A Make A Equal to B brute force greedy sortings *800	0 / 0	3
	920	codeforces#P1736B Playing with GCD math number theory *1200	0 / 0	4
	919	codeforces#P1736C1 Good Subarrays (Easy Version) binary search data structures schedules two pointers *1300	0 / 0	4
	918	codeforces#P1736C2 Good Subarrays (Hard Version) binary search data structures dp two pointers *2400	0 / 0	9
	917	codeforces#P1736D Equal Binary Subsequences constructive algorithms geometry greedy implementation strings *2200	0 / 0	8
	916	codeforces#P1736E Swap and Take dp greedy *2600	0 / 0	10
	915	codeforces#P1737A Ela Sorting Books greedy implementation strings *900	0 / 0	3
	914	codeforces#P1737B Ela's Fitness and the Luxury Number binary search implementation math *1300	0 / 0	4
	913	codeforces#P1737C Ela and Crickets constructive algorithms games implementation math *1500	0 / 0	5
	912	codeforces#P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	911	codeforces#P1737E Ela Goes Hiking combinatorics dp math probabilities *2500	0 / 0	9
	910	codeforces#P1737F Ela and Prime GCD constructive algorithms math number theory *3300	0 / 0	10
	909	codeforces#P1737G Ela Takes Dancing Class binary search data structures *3500	0 / 0	10
	908	codeforces#P1738A Glory Addicts greedy implementation sortings *800	0 / 0	3
	907	codeforces#P1738B Prefix Sum Addicts constructive algorithms greedy math sortings *1200	0 / 0	4
	906	codeforces#P1738C Even Number Addicts dp games greedy math *1500	0 / 0	5
	905	codeforces#P1738D Permutation Addicts constructive algorithms data structures dfs and similar dsu graphs trees *1900	0 / 0	6
	904	codeforces#P1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	8
	903	codeforces#P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths trees *2400	0 / 0	9
	902	codeforces#P1738G Anti-Increasing Addicts constructive algorithms dp greedy math *2900	0 / 0	10
	901	codeforces#P1738H Palindrome Addicts data structures strings *3300	0 / 0	10
	900	codeforces#P1739A Immobile Knight implementation *800	0 / 0	3
	899	codeforces#P1739B Array Recovery constructive algorithms greedy math *1100	0 / 0	3
	898	codeforces#P1739C Card Game combinatorics constructive algorithms dp games *1500	0 / 0	5
	897	codeforces#P1739D Reset K Edges binary search data structures dfs and similar graphs greedy trees *1900	0 / 0	6
	896	codeforces#P1739E Cleaning Robot bitmasks dp *2400	0 / 0	9
	895	codeforces#P1739F Keyboard Design bitmasks data structures dp string suffix structures strings *2600	0 / 0	10
	894	codeforces#P1740A Factorise N+M constructive algorithms number theory *800	0 / 0	3
	893	codeforces#P1740B Jumbo Extra Cheese 2 geometry greedy sortings *800	0 / 0	3
	892	codeforces#P1740C Bricks and Bags constructive algorithms games greedy sortings *1400	0 / 0	4
	891	codeforces#P1740D Knowledge Cards constructive algorithms data structures *1500	0 / 0	5
	890	codeforces#P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	889	codeforces#P1740F Conditional Mix combinatorics dp math *2600	0 / 0	10
	888	codeforces#P1740G Dangerous Laser Power constructive algorithms dsu sortings *3100	0 / 0	10
	887	codeforces#P1740H MEX Tree Manipulation data structures trees *3300	0 / 0	10
	886	codeforces#P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
	885	codeforces#P1741A Compare T-Shirt Sizes implementation implementation strings *800	0 / 0	3
	884	codeforces#P1741B Funny Permutation constructive algorithms math *800	0 / 0	3
	883	codeforces#P1741C Minimize the Thickness brute force greedy math two pointers *1100	0 / 0	3
	882	codeforces#P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees *1300	0 / 0	4
	881	codeforces#P1741E Sending a Sequence Over the Network dp *1600	0 / 0	5
	880	codeforces#P1741F Multi-Colored Segments binary search data structures math sortings *2000	0 / 0	7
	879	codeforces#P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	878	codeforces#P1742A Sum implementation *800	0 / 0	3
	877	codeforces#P1742B Increasing greedy implementation sortings *800	0 / 0	3
	876	codeforces#P1742C Stripes implementation *900	0 / 0	3
	875	codeforces#P1742D Coprime brute force greedy number theory *1100	0 / 0	3
	874	codeforces#P1742E Scuza binary search greedy math *1200	0 / 0	4
	873	codeforces#P1742F Smaller constructive algorithms greedy strings *1500	0 / 0	5
	872	codeforces#P1742G Orray bitmasks brute force greedy math sortings *1500	0 / 0	5
	871	codeforces#P1743A Password brute force combinatorics implementation math *800	0 / 0	3
	870	codeforces#P1743B Permutation Value constructive algorithms greedy *800	0 / 0	3
	869	codeforces#P1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	3
	868	codeforces#P1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	5
	867	codeforces#P1743E FTL binary search dp *2400	0 / 0	9
	866	codeforces#P1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	8
	865	codeforces#P1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp hashing math *3000	0 / 0	10
	864	codeforces#P1744A Number Replacement greedy implementation *800	0 / 0	3
	863	codeforces#P1744B Even-Odd Increments implementation math *800	0 / 0	3
	862	codeforces#P1744C Traffic Light binary search implementation two pointers *1000	0 / 0	3
	861	codeforces#P1744D Divisibility by 2^n greedy math sortings *1200	0 / 0	4
	860	codeforces#P1744E1 Divisible Numbers (easy version) brute force math number theory *1500	0 / 0	5
	859	codeforces#P1744E2 Divisible Numbers (hard version) brute force math number theory *1900	0 / 0	6
	858	codeforces#P1744F MEX vs MED math two pointers *2000	0 / 0	7
	857	codeforces#P1746A Maxmina constructive algorithms greedy *800	0 / 0	3

Pick a problem randomly based on the current filter.