Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	584	P1792F1 Graph Coloring (easy version) combinatorics dp graphs *2700	0 / 0	10
	583	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	582	P1793A Yet Another Promotion greedy math *800	0 / 0	3
	581	P1793B Fedya and Array constructive algorithms math *1100	0 / 0	3
	580	P1793C Dora and Search constructive algorithms data structures two pointers *1200	0 / 0	4
	579	P1793D Moscow Gorillas binary search dp greedy implementation math two pointers *1800	0 / 0	6
	578	P1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	10
	577	P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	576	P1794A Prefix and Suffix Array strings *800	0 / 0	3
	575	P1794B Not Dividing constructive algorithms greedy math *900	0 / 0	3
	574	P1794C Scoring Subsequences binary search greedy math two pointers *1300	0 / 0	4
	573	P1794D Counting Factorizations combinatorics divide and conquer dp math number theory *1900	0 / 0	6
	572	P1794E Labeling the Tree with Distances data structures dp greedy hashing implementation trees *2400	0 / 0	9
	571	P1795A Two Towers brute force implementation strings *800	0 / 0	3
	570	P1795B Ideal Point brute force geometry greedy *900	0 / 0	3
	569	P1795C Tea Tasting binary search data structures implementation *1500	0 / 0	5
	568	P1795D Triangle Coloring combinatorics math *1600	0 / 0	5
	567	P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	566	P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	9
	565	P1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	10
	564	P1796A Typical Interview Problem brute force implementation strings *800	0 / 0	3
	563	P1796B Asterisk-Minor Template implementation strings *1000	0 / 0	3
	562	P1796C Maximum Set binary search math *1600	0 / 0	5
	561	P1796D Maximum Subarray data structures dp greedy two pointers *2000	0 / 0	7
	560	P1796E Colored Subgraphs dfs and similar dp games greedy trees *2500	0 / 0	9
	559	P1796F Strange Triples brute force math number theory *2900	0 / 0	10
	558	P1797A Li Hua and Maze constructive algorithms flows graphs greedy implementation *800	0 / 0	3
	557	P1797B Li Hua and Pattern constructive algorithms greedy *1100	0 / 0	3
	556	P1797C Li Hua and Chess constructive algorithms greedy interactive *1600	0 / 0	5
	555	P1797D Li Hua and Tree brute force data structures dfs and similar dp implementation trees *1900	0 / 0	6
	554	P1797E Li Hua and Array brute force data structures dsu math number theory two pointers *2300	0 / 0	8
	553	P1797F Li Hua and Path data structures dfs and similar divide and conquer dsu trees *3000	0 / 0	10
	552	P1798A Showstopper greedy implementation sortings *800	0 / 0	3
	551	P1798B Three Sevens brute force data structures greedy implementation *1000	0 / 0	3
	550	P1798C Candy Store greedy math number theory *1700	0 / 0	5
	549	P1798D Shocking Arrangement constructive algorithms greedy math *1600	0 / 0	5
	548	P1798E Multitest Generator brute force dp *2300	0 / 0	8
	547	P1798F Gifts from Grandfather Ahmed dp math number theory *2500	0 / 0	9
	546	P1799A Recent Actions data structures greedy implementation math *800	0 / 0	3
	545	P1799B Equalize by Divide brute force constructive algorithms greedy math *1200	0 / 0	4
	544	P1799C Double Lexicographically Minimum greedy strings *1700	0 / 0	5
	543	P1799D1 Hot Start Up (easy version) dp *1900	0 / 0	6
	542	P1799D2 Hot Start Up (hard version) data structures dp *2100	0 / 0	7
	541	P1799E City Union constructive algorithms dfs and similar dsu geometry greedy implementation math *2300	0 / 0	8
	540	P1799F Halve or Subtract binary search brute force dp greedy sortings *2700	0 / 0	10
	539	P1799G Count Voting combinatorics dp math *2600	0 / 0	10
	538	P1799H Tree Cutting bitmasks dfs and similar dp *3200	0 / 0	10
	537	P1800A Is It a Cat? implementation strings *800	0 / 0	3
	536	P1800B Count the Number of Pairs greedy strings *1000	0 / 0	3
	535	P1800C1 Powering the Hero (easy version) data structures greedy *1000	0 / 0	3
	534	P1800C2 Powering the Hero (hard version) data structures greedy *1100	0 / 0	3
	533	P1800D Remove Two Letters data structures greedy hashing strings *1200	0 / 0	4
	532	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy strings *1400	0 / 0	4
	531	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dfs and similar dsu graphs greedy strings *1500	0 / 0	5
	530	P1800F Dasha and Nightmares bitmasks hashing meet-in-the-middle strings *1900	0 / 0	6
	529	P1800G Symmetree dfs and similar hashing implementation trees *2200	0 / 0	8
	528	P1801A The Very Beautiful Blanket bitmasks constructive algorithms *1600	0 / 0	5
	527	P1801B Buying gifts data structures greedy sortings *1800	0 / 0	6
	526	P1801C Music Festival binary search data structures dp greedy sortings *1900	0 / 0	6
	525	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	524	P1801E Gasoline prices data structures divide and conquer dsu hashing trees *3000	0 / 0	10
	523	P1801F Another n-dimensional chocolate bar dp math meet-in-the-middle number theory *2700	0 / 0	10
	522	P1801G A task for substrings data structures string suffix structures strings *3400	0 / 0	10
	521	P1802A Likes greedy implementation *800	0 / 0	3
	520	P1802B Settlement of Guinea Pigs greedy implementation math *1000	0 / 0	3
	519	P1804A Lame King greedy math *800	0 / 0	3
	518	P1804B Vaccination greedy implementation *1000	0 / 0	3
	517	P1804C Pull Your Luck brute force greedy math number theory *1500	0 / 0	5
	516	P1804D Accommodation brute force dp greedy implementation *2000	0 / 0	7
	515	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	514	P1804F Approximate Diameter binary search divide and conquer graphs shortest paths *2700	0 / 0	10
	513	P1804G Flow Control data structures dsu implementation *3500	0 / 0	10
	512	P1804H Code Lock bitmasks dp *3300	0 / 0	10
	511	P1805A We Need the Zero bitmasks brute force *800	0 / 0	3
	510	P1805B The String Has a Target greedy strings *800	0 / 0	3
	509	P1805C Place for a Selfie binary search data structures geometry math *1400	0 / 0	4
	508	P1805D A Wide, Wide Graph dfs and similar dp graphs greedy trees *1800	0 / 0	6
	507	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers *2300	0 / 0	8
	506	P1805F1 Survival of the Weakest (easy version) binary search brute force implementation math sortings *2600	0 / 0	10
	505	P1805F2 Survival of the Weakest (hard version) greedy math sortings two pointers *3100	0 / 0	10
	504	P1806A Walking Master geometry greedy math *800	0 / 0	3
	503	P1806B Mex Master constructive algorithms greedy *900	0 / 0	3
	502	P1806C Sequence Master brute force constructive algorithms math *1600	0 / 0	5
	501	P1806D DSU Master combinatorics dp dsu math *2500	0 / 0	9
	500	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	499	P1806F1 GCD Master (easy version) greedy math number theory sortings *2900	0 / 0	10
	498	P1806F2 GCD Master (hard version) greedy math sortings *2900	0 / 0	10
	497	P1807A Plus or Minus implementation *800	0 / 0	3
	496	P1807B Grab the Candies greedy *800	0 / 0	3
	495	P1807C Find and Replace greedy implementation strings *800	0 / 0	3
	494	P1807D Odd Queries data structures implementation *900	0 / 0	3
	493	P1807E Interview binary search implementation interactive *1300	0 / 0	4
	492	P1807F Bouncy Ball brute force dfs and similar implementation *1700	0 / 0	5
	491	P1807G1 Subsequence Addition (Easy Version) brute force data structures dp greedy implementation sortings *1100	0 / 0	3
	490	P1807G2 Subsequence Addition (Hard Version) bitmasks dp greedy implementation sortings *1100	0 / 0	3
	489	P1808A Lucky Numbers brute force implementation *900	0 / 0	3
	488	P1808B Playing in a Casino math sortings *1200	0 / 0	4
	487	P1808C Unlucky Numbers brute force dp greedy implementation *1900	0 / 0	6
	486	P1808D Petya, Petya, Petr, and Palindromes binary search brute force data structures two pointers *2100	0 / 0	7
	485	P1808E1 Minibuses on Venus (easy version) combinatorics divide and conquer dp *2200	0 / 0	8

Pick a problem randomly based on the current filter.