Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5071	P1899A Game with Integers games math number theory	0 / 0	(None)
	5070	P1899B 250 Thousand Tons of TNT brute force implementation number theory	0 / 0	(None)
	5069	P1899C Yarik and Array dp greedy two pointers	0 / 0	(None)
	5068	P1899D Yarik and Musical Notes math number theory	0 / 0	(None)
	5067	P1899E Queue Sort greedy implementation sortings	0 / 0	(None)
	5066	P1899F Alex's whims constructive algorithms graphs shortest paths trees	0 / 0	(None)
	5065	P1899G Unusual Entertainment data structures dfs and similar dsu shortest paths sortings trees two pointers	0 / 0	(None)
	5349	P1900A Cover in Water constructive algorithms greedy implementation strings *800	0 / 0	3
	5348	P1900B Laura and Operations dp math *900	0 / 0	3
	5347	P1900C Anji's Binary Tree dfs and similar dp shortest paths trees *1300	0 / 0	4
	5346	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	5345	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	0 / 0	7
	5344	P1900F Local Deletions binary search data structures implementation *2800	0 / 0	10
	5139	P1901A Line Trip math *800	0 / 0	3
	5138	P1901B Chip and Ribbon greedy math *1100	0 / 0	3
	5137	P1901C Add, Divide and Floor constructive algorithms greedy math *1400	0 / 0	4
	5136	P1901D Yet Another Monster Fight binary search dp greedy implementation math *1700	0 / 0	5
	5135	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	5134	P1901F Landscaping binary search geometry *2900	0 / 0	10
	6625	P1902A Binary Imbalance constructive algorithms *800	0 / 0	3
	6624	P1902B Getting Points binary search brute force greedy *1100	0 / 0	3
	6623	P1902C Insert and Equalize brute force constructive algorithms greedy math number theory *1300	0 / 0	4
	6622	P1902D Robot Queries binary search data structures dp implementation *1900	0 / 0	6
	6621	P1902E Collapsing Strings data structures strings trees *1900	0 / 0	6
	6620	P1902F Trees and XOR Queries Again data structures dfs and similar divide and conquer graphs implementation math trees *2400	0 / 0	9
	5343	P1903A Halloumi Boxes brute force greedy sortings *800	0 / 0	3
	5342	P1903B StORage room bitmasks brute force constructive algorithms greedy *1200	0 / 0	4
	5341	P1903C Theofanis' Nightmare constructive algorithms dp greedy *1400	0 / 0	4
	5340	P1903D1 Maximum And Queries (easy version) binary search bitmasks brute force greedy *1700	0 / 0	5
	5339	P1903D2 Maximum And Queries (hard version) binary search bitmasks divide and conquer dp greedy *2500	0 / 0	9
	5338	P1903E Geo Game constructive algorithms dp games greedy interactive math *2000	0 / 0	7
	5337	P1903F Babysitting 2-sat binary search data structures graphs trees *2500	0 / 0	9
	6710	P1904A Forked! brute force implementation *900	0 / 0	3
	6709	P1904B Collecting Game binary search dp greedy sortings two pointers *1100	0 / 0	3
	6708	P1904C Array Game binary search brute force data structures sortings two pointers *1400	0 / 0	4
	6707	P1904D1 Set To Max (Easy Version) brute force constructive algorithms greedy *1600	0 / 0	5
	6706	P1904D2 Set To Max (Hard Version) constructive algorithms data structures divide and conquer greedy implementation sortings *1800	0 / 0	6
	6705	P1904E Tree Queries data structures dfs and similar graphs implementation trees *2500	0 / 0	9
	6704	P1904F Beautiful Tree data structures dfs and similar graphs implementation trees *2800	0 / 0	10
	6703	P1905A Constructive Problems constructive algorithms math *800	0 / 0	3
	6702	P1905B Begginer's Zelda greedy trees *1100	0 / 0	3
	6701	P1905C Largest Subsequence greedy strings *1400	0 / 0	4
	6700	P1905D Cyclic MEX data structures implementation math two pointers *2000	0 / 0	7
	6699	P1905E One-X combinatorics dfs and similar dp math trees *2400	0 / 0	9
	6698	P1905F Field Should Not Be Empty brute force data structures divide and conquer *2600	0 / 0	10
	6619	P1906A Easy As ABC brute force *1000	0 / 0	3
	6618	P1906B Button Pressing bitmasks constructive algorithms hashing *2600	0 / 0	10
	6617	P1906C Cursed Game interactive *3000	0 / 0	10
	6616	P1906D Spaceship Exploration binary search geometry *2800	0 / 0	10
	6615	P1906E Merge Not Sort constructive algorithms dp *1900	0 / 0	6
	6614	P1906F Maximize The Value data structures sortings *2000	0 / 0	7
	6613	P1906G Grid Game 2 games number theory *2900	0 / 0	10
	6612	P1906H Twin Friends combinatorics dp *2200	0 / 0	8
	6611	P1906I Contingency Plan 2 graph matchings *2900	0 / 0	10
	6610	P1906J Count BFS Graph combinatorics dp *2100	0 / 0	7
	6609	P1906K Deck-Building Game divide and conquer math *2500	0 / 0	9
	6608	P1906L Palindromic Parentheses constructive algorithms *2500	0 / 0	9
	6607	P1906M Triangle Construction greedy math *1700	0 / 0	5
	6606	P1907A Rook implementation *800	0 / 0	3
	6605	P1907B YetnotherrokenKeoard data structures implementation strings *1000	0 / 0	3
	6604	P1907C Removal of Unattractive Pairs constructive algorithms greedy math strings *1100	0 / 0	3
	6603	P1907D Jumping Through Segments binary search constructive algorithms *1400	0 / 0	4
	6602	P1907E Good Triples brute force combinatorics number theory *1600	0 / 0	5
	6601	P1907F Shift and Reverse greedy sortings *1800	0 / 0	6
	6600	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	6697	P1909A Distinct Buttons implementation math *800	0 / 0	3
	6696	P1909B Make Almost Equal With Mod bitmasks constructive algorithms math number theory *1200	0 / 0	4
	6695	P1909C Heavy Intervals constructive algorithms data structures dsu greedy math sortings *1400	0 / 0	4
	6694	P1909D Split Plus K greedy math number theory *1900	0 / 0	6
	6693	P1909E Multiple Lamps bitmasks brute force constructive algorithms math number theory *2400	0 / 0	9
	6692	P1909F1 Small Permutation Problem (Easy Version) brute force combinatorics dp math *2200	0 / 0	8
	6691	P1909F2 Small Permutation Problem (Hard Version) combinatorics dp math *2500	0 / 0	9
	6690	P1909G Pumping Lemma hashing strings *3000	0 / 0	10
	6689	P1909H Parallel Swaps Sort constructive algorithms data structures *3500	0 / 0	10
	6688	P1909I Short Permutation Problem combinatorics dp fft math *3500	0 / 0	10
	6687	P1910A Username special problem implementation 1100	0 / 0	3
	6686	P1910B Security Guard special problem greedy 1700	0 / 0	5
	6685	P1910C Poisonous Swamp special problem special problem implementation implementation *1600	0 / 0	5
	6684	P1910D Remove and Add special problem greedy 1800	0 / 0	6
	6683	P1910E Maximum Sum Subarrays special problem dp 2100	0 / 0	7
	6682	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	6681	P1910G Pool Records special problem greedy 2700	0 / 0	10
	6680	P1910H Sum of Digits of Sums special problem binary search data structures 2400	0 / 0	9
	6679	P1910I Inverse Problem special problem combinatorics dp 2700	0 / 0	10
	6678	P1910J Two Colors special problem 2900	0 / 0	10
	6677	P1912A Accumulator Apex data structures implementation sortings *1800	0 / 0	6
	6676	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	6675	P1912C __NO_TITLE__	0 / 0	(None)
	6674	P1912D Divisibility Test math *1900	0 / 0	6
	6673	P1912E Evaluate It and Back Again constructive algorithms implementation math *2200	0 / 0	8
	6672	P1912F Fugitive Frenzy math probabilities *3100	0 / 0	10
	6671	P1912G __NO_TITLE__	0 / 0	(None)
	6670	P1912H Hypercatapult Commute graphs *2400	0 / 0	9
	6669	P1912I __NO_TITLE__	0 / 0	(None)
	6668	P1912J __NO_TITLE__	0 / 0	(None)
	6667	P1912K Kim's Quest bitmasks combinatorics dp *1800	0 / 0	6
	6666	P1912L LOL Lovers strings *800	0 / 0	3
	6665	P1913A Rating Increase implementation *800	0 / 0	3
	6664	P1913B Swap and Delete strings *1000	0 / 0	3
	6663	P1913C Game with Multiset binary search bitmasks brute force greedy *1300	0 / 0	4

Pick a problem randomly based on the current filter.