Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3784	P1189A Keanu Reeves strings *800	0 / 0	3
	3783	P1189B Number Circle greedy math sortings *1100	0 / 0	3
	3782	P1189C Candies! data structures dp implementation math *1400	0 / 0	4
	3781	P1190A Tokitsukaze and Discard Items implementation two pointers *1400	0 / 0	4
	3780	P1190B Tokitsukaze, CSL and Stone Game games *1800	0 / 0	6
	3779	P1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	8
	3778	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	7
	3777	P1190E Tokitsukaze and Explosion binary search greedy *3100	0 / 0	10
	3776	P1190F Tokitsukaze and Powers number theory probabilities *3400	0 / 0	10
	3775	P1191A Tokitsukaze and Enhancement brute force *800	0 / 0	3
	3774	P1191B Tokitsukaze and Mahjong brute force implementation *1200	0 / 0	4
	3773	P1192A Building Skyscrapers *special problem	0 / 0	(None)
	3772	P1192B Dynamic Diameter *special problem data structures dfs and similar divide and conquer trees	0 / 0	(None)
	3771	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(None)
	3770	P1193A Amusement Park *special problem dp math	0 / 0	(None)
	3769	P1193B Magic Tree *special problem data structures dp trees	0 / 0	(None)
	3768	P1193C Scissors and Tape *special problem constructive algorithms geometry	0 / 0	(None)
	3767	P1194A Remove a Progression math *800	0 / 0	3
	3766	P1194B Yet Another Crosses Problem implementation *1300	0 / 0	4
	3765	P1194C From S To T implementation strings *1300	0 / 0	4
	3764	P1194D 1-2-K Game games math *1700	0 / 0	5
	3763	P1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	0 / 0	8
	3762	P1194F Crossword Expert combinatorics dp number theory probabilities two pointers *2400	0 / 0	9
	3761	P1194G Another Meme Problem dp *2700	0 / 0	10
	3760	P1195A Drinks Choosing greedy math *1000	0 / 0	3
	3759	P1195B Sport Mafia binary search brute force math *1000	0 / 0	3
	3758	P1195C Basketball Exercise dp *1400	0 / 0	4
	3757	P1195D1 Submarine in the Rybinsk Sea (easy edition) combinatorics math number theory *1500	0 / 0	5
	3756	P1195D2 Submarine in the Rybinsk Sea (hard edition) combinatorics math number theory *1800	0 / 0	6
	3755	P1195E OpenStreetMap data structures two pointers *2100	0 / 0	7
	3754	P1195F Geometers Anonymous Club data structures geometry math sortings *2500	0 / 0	9
	3753	P1196A Three Piles of Candies brute force constructive algorithms math *800	0 / 0	3
	3752	P1196B Odd Sum Segments constructive algorithms math *1200	0 / 0	4
	3751	P1196C Robot Breakout implementation *1500	0 / 0	5
	3750	P1196D1 RGB Substring (easy version) implementation *1500	0 / 0	5
	3749	P1196D2 RGB Substring (hard version) data structures dp implementation two pointers *1600	0 / 0	5
	3748	P1196E Connected Component on a Chessboard constructive algorithms implementation *1800	0 / 0	6
	3747	P1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	8
	3746	P1197A DIY Wooden Ladder greedy math sortings *900	0 / 0	3
	3745	P1197B Pillars greedy implementation *1000	0 / 0	3
	3744	P1197C Array Splitting greedy sortings *1400	0 / 0	4
	3743	P1197D Yet Another Subarray Problem dp greedy math *1900	0 / 0	6
	3742	P1197E Culture Code binary search combinatorics data structures dp shortest paths sortings *2300	0 / 0	8
	3741	P1197F Coloring Game dp games matrices *2700	0 / 0	10
	3740	P1198A MP3 sortings two pointers *1600	0 / 0	5
	3739	P1198B Welfare State binary search brute force data structures sortings *1600	0 / 0	5
	3738	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	7
	3737	P1198D Rectangle Painting 1 dp *2300	0 / 0	8
	3736	P1198E Rectangle Painting 2 flows graph matchings graphs *2500	0 / 0	9
	3735	P1198F GCD Groups 2 greedy number theory probabilities *2900	0 / 0	10
	3734	P1199A City Day implementation *1000	0 / 0	3
	3733	P1199B Water Lily geometry math *1000	0 / 0	3
	3732	P1200A Hotelier brute force data structures implementation *800	0 / 0	3
	3731	P1200B Block Adventure dp greedy *1200	0 / 0	4
	3730	P1200C Round Corridor math number theory *1400	0 / 0	4
	3729	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	6
	3728	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	7
	3727	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	8
	3726	P1201A Important Exam implementation strings *900	0 / 0	3
	3725	P1201B Zero Array greedy math *1500	0 / 0	5
	3724	P1201C Maximum Median binary search greedy math sortings *1400	0 / 0	4
	3723	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	7
	3722	P1201E1 Knightmare (easy) graphs interactive shortest paths *2900	0 / 0	10
	3721	P1201E2 Knightmare (hard) graphs interactive shortest paths *3000	0 / 0	10
	3720	P1202A You Are Given Two Binary Strings... bitmasks greedy *1100	0 / 0	3
	3719	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	5
	3718	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	7
	3717	P1202D Print a 1337-string... combinatorics constructive algorithms math strings *1900	0 / 0	6
	3716	P1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	9
	3715	P1202F You Are Given Some Letters... binary search implementation math *2700	0 / 0	10
	3714	P1203A Circle of Students implementation *1000	0 / 0	3
	3713	P1203B Equal Rectangles greedy math *1200	0 / 0	4
	3712	P1203C Common Divisors implementation math *1300	0 / 0	4
	3711	P1203D1 Remove the Substring (easy version) greedy implementation *1600	0 / 0	5
	3710	P1203D2 Remove the Substring (hard version) binary search greedy implementation two pointers *1700	0 / 0	5
	3709	P1203E Boxers greedy sortings *1500	0 / 0	5
	3708	P1203F1 Complete the Projects (easy version) greedy *2100	0 / 0	7
	3707	P1203F2 Complete the Projects (hard version) dp greedy *2300	0 / 0	8
	3706	P1204A BowWow and the Timetable math *1000	0 / 0	3
	3705	P1204B Mislove Has Lost an Array greedy math *900	0 / 0	3
	3704	P1204C Anna, Svyatoslav and Maps dp graphs greedy shortest paths *1700	0 / 0	5
	3703	P1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	7
	3702	P1204D2 Kirk and a Binary String (hard version) data structures greedy math strings *2100	0 / 0	7
	3701	P1204E Natasha, Sasha and the Prefix Sums combinatorics dp math number theory *2300	0 / 0	8
	3700	P1205A Almost Equal constructive algorithms greedy math *1200	0 / 0	4
	3699	P1205B Shortest Cycle bitmasks brute force graphs shortest paths *1900	0 / 0	6
	3698	P1205C Palindromic Paths implementation interactive *2400	0 / 0	9
	3697	P1205D Almost All constructive algorithms trees *2700	0 / 0	10
	3696	P1205E Expected Value Again combinatorics strings *3100	0 / 0	10
	3695	P1205F Beauty of a Permutation constructive algorithms math *3400	0 / 0	10
	3694	P1206A Choose Two Numbers math sortings *800	0 / 0	3
	3693	P1206B Make Product Equal One dp implementation *900	0 / 0	3
	3692	P1207A There Are Two Types Of Burgers brute force greedy implementation math *800	0 / 0	3
	3691	P1207B Square Filling constructive algorithms greedy implementation *1200	0 / 0	4
	3690	P1207C Gas Pipeline dp greedy *1500	0 / 0	5
	3689	P1207D Number Of Permutations combinatorics *1800	0 / 0	6
	3688	P1207E XOR Guessing bitmasks interactive math *1900	0 / 0	6
	3687	P1207F Remainder Problem brute force data structures implementation *2100	0 / 0	7
	3686	P1207G Indie Album data structures dfs and similar hashing string suffix structures strings trees *2700	0 / 0	10
	3685	P1208A XORinacci math *900	0 / 0	3

Pick a problem randomly based on the current filter.