Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	656	codeforces#P1780A Hayato and School constructive algorithms greedy *800	0 / 0	3
	655	codeforces#P1780B GCD Partition brute force greedy math number theory *1100	0 / 0	3
	654	codeforces#P1780D Bit Guessing Game binary search bitmasks constructive algorithms interactive *1800	0 / 0	6
	653	codeforces#P1780E Josuke and Complete Graph binary search brute force data structures math number theory *2400	0 / 0	9
	652	codeforces#P1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	8
	651	codeforces#P1780G Delicious Dessert binary search dsu hashing math number theory string suffix structures *2400	0 / 0	9
	650	codeforces#P1781A Parallel Projection geometry math *800	0 / 0	3
	649	codeforces#P1781B Going to the Cinema brute force greedy sortings *1000	0 / 0	3
	648	codeforces#P1781C Equal Frequencies brute force constructive algorithms greedy implementation sortings strings *1600	0 / 0	5
	647	codeforces#P1781D Many Perfect Squares brute force math number theory *1800	0 / 0	6
	646	codeforces#P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	645	codeforces#P1781F Bracket Insertion combinatorics dp math trees *2700	0 / 0	10
	644	codeforces#P1781G Diverse Coloring constructive algorithms trees *3200	0 / 0	10
	643	codeforces#P1781H1 Window Signals (easy version) *3200	0 / 0	10
	642	codeforces#P1781H2 Window Signals (hard version) *3500	0 / 0	10
	641	codeforces#P1783A Make it Beautiful constructive algorithms math sortings *800	0 / 0	3
	640	codeforces#P1783B Matrix of Differences constructive algorithms math *1100	0 / 0	3
	639	codeforces#P1783C Yet Another Tournament binary search greedy sortings *1700	0 / 0	5
	638	codeforces#P1783D Different Arrays brute force dp implementation *2000	0 / 0	7
	637	codeforces#P1783E Game of the Year brute force data structures math number theory *2300	0 / 0	8
	636	codeforces#P1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	9
	635	codeforces#P1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	10
	634	codeforces#P1784A Monsters (easy version) brute force greedy *1000	0 / 0	3
	633	codeforces#P1784B Letter Exchange constructive algorithms *1900	0 / 0	6
	632	codeforces#P1784C Monsters (hard version) data structures greedy *2200	0 / 0	8
	631	codeforces#P1784D Wooden Spoon combinatorics dp *2400	0 / 0	9
	630	codeforces#P1784E Infinite Game brute force combinatorics dp games probabilities *3100	0 / 0	10
	629	codeforces#P1784F Minimums or Medians *3400	0 / 0	10
	628	codeforces#P1786A1 Non-alternating Deck (easy version) implementation *800	0 / 0	3
	627	codeforces#P1786A2 Alternating Deck (hard version) implementation *800	0 / 0	3
	626	codeforces#P1786B Cake Assembly Line brute force sortings *1300	0 / 0	4
	625	codeforces#P1787A Exponential Equation constructive algorithms math *800	0 / 0	3
	624	codeforces#P1787B Number Factorization greedy math number theory *1100	0 / 0	3
	623	codeforces#P1787C Remove the Bracket dp greedy math *1600	0 / 0	5
	622	codeforces#P1787D Game on Axis combinatorics dfs and similar dsu graphs implementation *1900	0 / 0	6
	621	codeforces#P1787E The Harmonization of XOR bitmasks constructive algorithms greedy math *2100	0 / 0	7
	620	codeforces#P1787F Inverse Transformation constructive algorithms implementation math *2500	0 / 0	9
	619	codeforces#P1787G Colorful Tree Again brute force data structures trees *3000	0 / 0	10
	618	codeforces#P1787H Codeforces Scoreboard binary search data structures dp geometry *3300	0 / 0	10
	617	codeforces#P1787I Treasure Hunt data structures divide and conquer two pointers *3400	0 / 0	10
	616	codeforces#P1788A One and Two brute force implementation math *800	0 / 0	3
	615	codeforces#P1788B Sum of Two Numbers constructive algorithms greedy implementation math probabilities *1100	0 / 0	3
	614	codeforces#P1788C Matching Numbers constructive algorithms greedy math *1300	0 / 0	4
	613	codeforces#P1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	7
	612	codeforces#P1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	8
	611	codeforces#P1788F XOR, Tree, and Queries bitmasks constructive algorithms dfs and similar dsu graphs greedy implementation trees *2500	0 / 0	9
	610	codeforces#P1789A Serval and Mocha's Array brute force math number theory *800	0 / 0	3
	609	codeforces#P1789B Serval and Inversion Magic brute force implementation strings two pointers *800	0 / 0	3
	608	codeforces#P1789C Serval and Toxel's Arrays combinatorics dp implementation math *1500	0 / 0	5
	607	codeforces#P1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation *2200	0 / 0	8
	606	codeforces#P1789E Serval and Music Game brute force dp implementation math number theory *2500	0 / 0	9
	605	codeforces#P1789F Serval and Brain Power bitmasks brute force dp greedy implementation strings *2700	0 / 0	10
	604	codeforces#P1790A Polycarp and the Day of Pi implementation math strings *800	0 / 0	3
	603	codeforces#P1790B Taisia and Dice greedy greedy math *800	0 / 0	3
	602	codeforces#P1790C Premutation brute force implementation math *1000	0 / 0	3
	601	codeforces#P1790D Matryoshkas data structures greedy sortings *1200	0 / 0	4
	600	codeforces#P1790E Vlad and a Pair of Numbers bitmasks constructive algorithms *1400	0 / 0	4
	599	codeforces#P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	598	codeforces#P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	597	codeforces#P1791A Codeforces Checking implementation strings *800	0 / 0	3
	596	codeforces#P1791B Following Directions geometry implementation *800	0 / 0	3
	595	codeforces#P1791C Prepend and Append implementation two pointers *800	0 / 0	3
	594	codeforces#P1791D Distinct Split brute force greedy strings *1000	0 / 0	3
	593	codeforces#P1791E Negatives and Positives dp greedy sortings *1100	0 / 0	3
	592	codeforces#P1791F Range Update Point Query binary search brute force data structures *1500	0 / 0	5
	591	codeforces#P1791G1 Teleporters (Easy Version) greedy sortings *1100	0 / 0	3
	590	codeforces#P1791G2 Teleporters (Hard Version) binary search greedy sortings *1900	0 / 0	6
	589	codeforces#P1792A GamingForces greedy sortings *800	0 / 0	3
	588	codeforces#P1792B Stand-up Comedian greedy math *1200	0 / 0	4
	587	codeforces#P1792C Min Max Sort binary search brute force greedy math two pointers *1500	0 / 0	5
	586	codeforces#P1792D Fixed Prefix Permutations binary search bitmasks data structures hashing math sortings *1700	0 / 0	5
	585	codeforces#P1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	9
	584	codeforces#P1792F1 Graph Coloring (easy version) combinatorics dp graphs *2700	0 / 0	10
	583	codeforces#P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	582	codeforces#P1793A Yet Another Promotion greedy math *800	0 / 0	3
	581	codeforces#P1793B Fedya and Array constructive algorithms math *1100	0 / 0	3
	580	codeforces#P1793C Dora and Search constructive algorithms data structures two pointers *1200	0 / 0	4
	579	codeforces#P1793D Moscow Gorillas binary search dp greedy implementation math two pointers *1800	0 / 0	6
	578	codeforces#P1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	10
	577	codeforces#P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	576	codeforces#P1794A Prefix and Suffix Array strings *800	0 / 0	3
	575	codeforces#P1794B Not Dividing constructive algorithms greedy math *900	0 / 0	3
	574	codeforces#P1794C Scoring Subsequences binary search greedy math two pointers *1300	0 / 0	4
	573	codeforces#P1794D Counting Factorizations combinatorics divide and conquer dp math number theory *1900	0 / 0	6
	572	codeforces#P1794E Labeling the Tree with Distances data structures dp greedy hashing implementation trees *2400	0 / 0	9
	571	codeforces#P1795A Two Towers brute force implementation strings *800	0 / 0	3
	570	codeforces#P1795B Ideal Point brute force geometry greedy *900	0 / 0	3
	569	codeforces#P1795C Tea Tasting binary search data structures implementation *1500	0 / 0	5
	568	codeforces#P1795D Triangle Coloring combinatorics math *1600	0 / 0	5
	567	codeforces#P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	566	codeforces#P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	9
	565	codeforces#P1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	10
	564	codeforces#P1796A Typical Interview Problem brute force implementation strings *800	0 / 0	3
	563	codeforces#P1796B Asterisk-Minor Template implementation strings *1000	0 / 0	3
	562	codeforces#P1796C Maximum Set binary search math *1600	0 / 0	5
	561	codeforces#P1796D Maximum Subarray data structures dp greedy two pointers *2000	0 / 0	7
	560	codeforces#P1796E Colored Subgraphs dfs and similar dp games greedy trees *2500	0 / 0	9
	559	codeforces#P1796F Strange Triples brute force math number theory *2900	0 / 0	10
	558	codeforces#P1797A Li Hua and Maze constructive algorithms flows graphs greedy implementation *800	0 / 0	3
	557	codeforces#P1797B Li Hua and Pattern constructive algorithms greedy *1100	0 / 0	3

Pick a problem randomly based on the current filter.