Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5340	codeforces#P1903D1 Maximum And Queries (easy version) binary search bitmasks brute force greedy *1700	0 / 0	5
	5339	codeforces#P1903D2 Maximum And Queries (hard version) binary search bitmasks divide and conquer dp greedy *2500	0 / 0	9
	5338	codeforces#P1903E Geo Game constructive algorithms dp games greedy interactive math *2000	0 / 0	7
	5337	codeforces#P1903F Babysitting 2-sat binary search data structures graphs trees *2500	0 / 0	9
	6710	codeforces#P1904A Forked! brute force implementation *900	0 / 0	3
	6709	codeforces#P1904B Collecting Game binary search dp greedy sortings two pointers *1100	0 / 0	3
	6708	codeforces#P1904C Array Game binary search brute force data structures sortings two pointers *1400	0 / 0	4
	6707	codeforces#P1904D1 Set To Max (Easy Version) brute force constructive algorithms greedy *1600	0 / 0	5
	6706	codeforces#P1904D2 Set To Max (Hard Version) constructive algorithms data structures divide and conquer greedy implementation sortings *1800	0 / 0	6
	6705	codeforces#P1904E Tree Queries data structures dfs and similar graphs implementation trees *2500	0 / 0	9
	6704	codeforces#P1904F Beautiful Tree data structures dfs and similar graphs implementation trees *2800	0 / 0	10
	6703	codeforces#P1905A Constructive Problems constructive algorithms math *800	0 / 0	3
	6702	codeforces#P1905B Begginer's Zelda greedy trees *1100	0 / 0	3
	6701	codeforces#P1905C Largest Subsequence greedy strings *1400	0 / 0	4
	6700	codeforces#P1905D Cyclic MEX data structures implementation math two pointers *2000	0 / 0	7
	6699	codeforces#P1905E One-X combinatorics dfs and similar dp math trees *2400	0 / 0	9
	6698	codeforces#P1905F Field Should Not Be Empty brute force data structures divide and conquer *2600	0 / 0	10
	6619	codeforces#P1906A Easy As ABC brute force *1000	0 / 0	3
	6618	codeforces#P1906B Button Pressing bitmasks constructive algorithms hashing *2600	0 / 0	10
	6617	codeforces#P1906C Cursed Game interactive *3000	0 / 0	10
	6616	codeforces#P1906D Spaceship Exploration binary search geometry *2800	0 / 0	10
	6615	codeforces#P1906E Merge Not Sort constructive algorithms dp *1900	0 / 0	6
	6614	codeforces#P1906F Maximize The Value data structures sortings *2000	0 / 0	7
	6613	codeforces#P1906G Grid Game 2 games number theory *2900	0 / 0	10
	6612	codeforces#P1906H Twin Friends combinatorics dp *2200	0 / 0	8
	6611	codeforces#P1906I Contingency Plan 2 graph matchings *2900	0 / 0	10
	6610	codeforces#P1906J Count BFS Graph combinatorics dp *2100	0 / 0	7
	6609	codeforces#P1906K Deck-Building Game divide and conquer math *2500	0 / 0	9
	6608	codeforces#P1906L Palindromic Parentheses constructive algorithms *2500	0 / 0	9
	6607	codeforces#P1906M Triangle Construction greedy math *1700	0 / 0	5
	6606	codeforces#P1907A Rook implementation *800	0 / 0	3
	6605	codeforces#P1907B YetnotherrokenKeoard data structures implementation strings *1000	0 / 0	3
	6604	codeforces#P1907C Removal of Unattractive Pairs constructive algorithms greedy math strings *1100	0 / 0	3
	6603	codeforces#P1907D Jumping Through Segments binary search constructive algorithms *1400	0 / 0	4
	6602	codeforces#P1907E Good Triples brute force combinatorics number theory *1600	0 / 0	5
	6601	codeforces#P1907F Shift and Reverse greedy sortings *1800	0 / 0	6
	6600	codeforces#P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	6697	codeforces#P1909A Distinct Buttons implementation math *800	0 / 0	3
	6696	codeforces#P1909B Make Almost Equal With Mod bitmasks constructive algorithms math number theory *1200	0 / 0	4
	6695	codeforces#P1909C Heavy Intervals constructive algorithms data structures dsu greedy math sortings *1400	0 / 0	4
	6694	codeforces#P1909D Split Plus K greedy math number theory *1900	0 / 0	6
	6693	codeforces#P1909E Multiple Lamps bitmasks brute force constructive algorithms math number theory *2400	0 / 0	9
	6692	codeforces#P1909F1 Small Permutation Problem (Easy Version) brute force combinatorics dp math *2200	0 / 0	8
	6691	codeforces#P1909F2 Small Permutation Problem (Hard Version) combinatorics dp math *2500	0 / 0	9
	6690	codeforces#P1909G Pumping Lemma hashing strings *3000	0 / 0	10
	6689	codeforces#P1909H Parallel Swaps Sort constructive algorithms data structures *3500	0 / 0	10
	6688	codeforces#P1909I Short Permutation Problem combinatorics dp fft math *3500	0 / 0	10
	6687	codeforces#P1910A Username special problem implementation 1100	0 / 0	3
	6686	codeforces#P1910B Security Guard special problem greedy 1700	0 / 0	5
	6685	codeforces#P1910C Poisonous Swamp special problem special problem implementation implementation *1600	0 / 0	5
	6684	codeforces#P1910D Remove and Add special problem greedy 1800	0 / 0	6
	6683	codeforces#P1910E Maximum Sum Subarrays special problem dp 2100	0 / 0	7
	6682	codeforces#P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	6681	codeforces#P1910G Pool Records special problem greedy 2700	0 / 0	10
	6680	codeforces#P1910H Sum of Digits of Sums special problem binary search data structures 2400	0 / 0	9
	6679	codeforces#P1910I Inverse Problem special problem combinatorics dp 2700	0 / 0	10
	6678	codeforces#P1910J Two Colors special problem 2900	0 / 0	10
	6677	codeforces#P1912A Accumulator Apex data structures implementation sortings *1800	0 / 0	6
	6676	codeforces#P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	6675	codeforces#P1912C __NO_TITLE__	0 / 0	(None)
	6674	codeforces#P1912D Divisibility Test math *1900	0 / 0	6
	6673	codeforces#P1912E Evaluate It and Back Again constructive algorithms implementation math *2200	0 / 0	8
	6672	codeforces#P1912F Fugitive Frenzy math probabilities *3100	0 / 0	10
	6671	codeforces#P1912G __NO_TITLE__	0 / 0	(None)
	6670	codeforces#P1912H Hypercatapult Commute graphs *2400	0 / 0	9
	6669	codeforces#P1912I __NO_TITLE__	0 / 0	(None)
	6668	codeforces#P1912J __NO_TITLE__	0 / 0	(None)
	6667	codeforces#P1912K Kim's Quest bitmasks combinatorics dp *1800	0 / 0	6
	6666	codeforces#P1912L LOL Lovers strings *800	0 / 0	3
	6665	codeforces#P1913A Rating Increase implementation *800	0 / 0	3
	6664	codeforces#P1913B Swap and Delete strings *1000	0 / 0	3
	6663	codeforces#P1913C Game with Multiset binary search bitmasks brute force greedy *1300	0 / 0	4
	6662	codeforces#P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	6661	codeforces#P1913E Matrix Problem flows graphs *2400	0 / 0	9
	6660	codeforces#P1913F Palindromic Problem binary search data structures hashing string suffix structures strings *2800	0 / 0	10
	6659	codeforces#P1914A Problemsolving Log implementation strings *800	0 / 0	3
	6658	codeforces#P1914B Preparing for the Contest constructive algorithms math *800	0 / 0	3
	6657	codeforces#P1914C Quests greedy math *1100	0 / 0	3
	6656	codeforces#P1914D Three Activities brute force dp greedy implementation sortings *1200	0 / 0	4
	6655	codeforces#P1914E1 Game with Marbles (Easy Version) brute force games greedy sortings *1400	0 / 0	4
	6654	codeforces#P1914E2 Game with Marbles (Hard Version) games greedy sortings *1400	0 / 0	4
	6653	codeforces#P1914F Programming Competition dfs and similar dp graph matchings greedy trees *1900	0 / 0	6
	6652	codeforces#P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	6651	codeforces#P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	6650	codeforces#P1915A Odd One Out bitmasks implementation *800	0 / 0	3
	6649	codeforces#P1915B Not Quite Latin Square bitmasks brute force implementation *800	0 / 0	3
	6648	codeforces#P1915C Can I Square? binary search implementation *800	0 / 0	3
	6647	codeforces#P1915D Unnatural Language Processing greedy implementation strings *900	0 / 0	3
	6646	codeforces#P1915E Romantic Glasses data structures greedy math *1300	0 / 0	4
	6645	codeforces#P1915F Greetings data structures divide and conquer sortings *1500	0 / 0	5
	6644	codeforces#P1915G Bicycles graphs greedy implementation shortest paths sortings *1800	0 / 0	6
	6643	codeforces#P1916A 2023 constructive algorithms implementation math number theory *800	0 / 0	3
	6642	codeforces#P1916B Two Divisors constructive algorithms math number theory *900	0 / 0	3
	6641	codeforces#P1916C Training Before the Olympiad constructive algorithms games greedy implementation math *1200	0 / 0	4
	6640	codeforces#P1916D Mathematical Problem brute force constructive algorithms geometry math *1700	0 / 0	5
	6639	codeforces#P1916E Happy Life in University data structures dfs and similar greedy trees *2300	0 / 0	8
	6638	codeforces#P1916F Group Division constructive algorithms dfs and similar graphs greedy *2900	0 / 0	10
	6637	codeforces#P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	6636	codeforces#P1916H1 Matrix Rank (Easy Version) brute force combinatorics dp math matrices *2700	0 / 0	10
	6635	codeforces#P1916H2 Matrix Rank (Hard Version) combinatorics dp math matrices string suffix structures *2700	0 / 0	10

Pick a problem randomly based on the current filter.