Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4056	codeforces#P1140D Minimum Triangulation dp greedy math *1200	0 / 0	4
	4055	codeforces#P1140E Palindrome-less Arrays combinatorics divide and conquer dp *2200	0 / 0	8
	4054	codeforces#P1140F Extending Set of Points data structures divide and conquer dsu *2600	0 / 0	10
	4053	codeforces#P1140G Double Tree data structures divide and conquer shortest paths trees *2700	0 / 0	10
	4052	codeforces#P1141A Game 23 implementation math *1000	0 / 0	3
	4051	codeforces#P1141B Maximal Continuous Rest implementation *900	0 / 0	3
	4050	codeforces#P1141C Polycarp Restores Permutation math *1500	0 / 0	5
	4049	codeforces#P1141D Colored Boots greedy implementation *1500	0 / 0	5
	4048	codeforces#P1141E Superhero Battle math *1700	0 / 0	5
	4047	codeforces#P1141F1 Same Sum Blocks (Easy) greedy *1900	0 / 0	6
	4046	codeforces#P1141F2 Same Sum Blocks (Hard) data structures greedy *1900	0 / 0	6
	4045	codeforces#P1141G Privatization of Roads in Treeland binary search constructive algorithms dfs and similar graphs greedy trees *1900	0 / 0	6
	4044	codeforces#P1142A The Beatles brute force math *1700	0 / 0	5
	4043	codeforces#P1142B Lynyrd Skynyrd data structures dfs and similar dp math trees *2000	0 / 0	7
	4042	codeforces#P1142C U2 geometry *2400	0 / 0	9
	4041	codeforces#P1142D Foreigner dp *2800	0 / 0	10
	4040	codeforces#P1142E Pink Floyd graphs interactive *3200	0 / 0	10
	4039	codeforces#P1143A The Doors implementation *800	0 / 0	3
	4038	codeforces#P1143B Nirvana brute force math number theory *1200	0 / 0	4
	4037	codeforces#P1143C Queen dfs and similar trees *1400	0 / 0	4
	4036	codeforces#P1144A Diverse Strings implementation strings *800	0 / 0	3
	4035	codeforces#P1144B Parity Alternated Deletions greedy implementation sortings *900	0 / 0	3
	4034	codeforces#P1144C Two Shuffled Sequences constructive algorithms sortings *1000	0 / 0	3
	4033	codeforces#P1144D Equalize Them All constructive algorithms greedy *1400	0 / 0	4
	4032	codeforces#P1144E Median String bitmasks math number theory strings *1900	0 / 0	6
	4031	codeforces#P1144F Graph Without Long Directed Paths dfs and similar graphs *1700	0 / 0	5
	4030	codeforces#P1144G Two Merged Sequences dp greedy *2400	0 / 0	9
	4029	codeforces#P1145A Thanos Sort implementation	0 / 0	(None)
	4028	codeforces#P1145B Kanban Numbers brute force	0 / 0	(None)
	4027	codeforces#P1145C Mystery Circuit bitmasks brute force	0 / 0	(None)
	4026	codeforces#P1145D Pigeon d'Or implementation	0 / 0	(None)
	4025	codeforces#P1145E Fourier Doodles	0 / 0	(None)
	4024	codeforces#P1145F Neat Words	0 / 0	(None)
	4023	codeforces#P1145G AI Takeover interactive	0 / 0	(None)
	4022	codeforces#P1146A Love "A" implementation strings *800	0 / 0	3
	4021	codeforces#P1146B Hate "A" implementation strings *1100	0 / 0	3
	4020	codeforces#P1146C Tree Diameter bitmasks graphs interactive *1700	0 / 0	5
	4019	codeforces#P1146D Frog Jumping dfs and similar math number theory *2100	0 / 0	7
	4018	codeforces#P1146E Hot is Cold bitmasks data structures divide and conquer implementation *2400	0 / 0	9
	4017	codeforces#P1146F Leaf Partition dp trees *2500	0 / 0	9
	4016	codeforces#P1146G Zoning Restrictions dp flows graphs *2700	0 / 0	10
	4015	codeforces#P1146H Satanic Panic dp geometry *2900	0 / 0	10
	4014	codeforces#P1147A Hide and Seek graphs *1500	0 / 0	5
	4013	codeforces#P1147B Chladni Figure brute force strings *1900	0 / 0	6
	4012	codeforces#P1147C Thanos Nim games *2000	0 / 0	7
	4011	codeforces#P1147D Palindrome XOR dfs and similar graphs *2400	0 / 0	9
	4010	codeforces#P1147E Rainbow Coins interactive *3000	0 / 0	10
	4009	codeforces#P1147F Zigzag Game games interactive *3500	0 / 0	10
	4008	codeforces#P1148A Another One Bites The Dust greedy *800	0 / 0	3
	4007	codeforces#P1148B Born This Way binary search brute force two pointers *1600	0 / 0	5
	4006	codeforces#P1148C Crazy Diamond constructive algorithms sortings *1700	0 / 0	5
	4005	codeforces#P1148D Dirty Deeds Done Dirt Cheap greedy sortings *1800	0 / 0	6
	4004	codeforces#P1148E Earth Wind and Fire constructive algorithms greedy math sortings two pointers *2300	0 / 0	8
	4003	codeforces#P1148F Foo Fighters bitmasks constructive algorithms *2700	0 / 0	10
	4002	codeforces#P1148G Gold Experience constructive algorithms graphs math number theory probabilities *3300	0 / 0	10
	4001	codeforces#P1148H Holy Diver data structures *3500	0 / 0	10
	4000	codeforces#P1149A Prefix Sum Primes constructive algorithms greedy math number theory *1200	0 / 0	4
	3999	codeforces#P1149B Three Religions dp implementation strings *2200	0 / 0	8
	3998	codeforces#P1149C Tree Generator™ data structures implementation trees *2700	0 / 0	10
	3997	codeforces#P1149D Abandoning Roads brute force dp graphs greedy *3000	0 / 0	10
	3996	codeforces#P1149E Election Promises games graphs *3200	0 / 0	10
	3995	codeforces#P1150A Stock Arbitraging greedy implementation *800	0 / 0	3
	3994	codeforces#P1150B Tiling Challenge greedy implementation *900	0 / 0	3
	3993	codeforces#P1151A Maxim and Biology brute force strings *1000	0 / 0	3
	3992	codeforces#P1151B Dima and a Bad XOR bitmasks brute force constructive algorithms dp *1600	0 / 0	5
	3991	codeforces#P1151C Problem for Nazar constructive algorithms math *1800	0 / 0	6
	3990	codeforces#P1151D Stas and the Queue at the Buffet greedy math sortings *1600	0 / 0	5
	3989	codeforces#P1151E Number of Components combinatorics data structures dp math *2100	0 / 0	7
	3988	codeforces#P1151F Sonya and Informatics combinatorics dp matrices probabilities *2300	0 / 0	8
	3987	codeforces#P1152A Neko Finds Grapes greedy implementation math *800	0 / 0	3
	3986	codeforces#P1152B Neko Performs Cat Furrier Transform bitmasks constructive algorithms dfs and similar math *1300	0 / 0	4
	3985	codeforces#P1152C Neko does Maths brute force math number theory *1800	0 / 0	6
	3984	codeforces#P1152D Neko and Aki's Prank dp greedy trees *2100	0 / 0	7
	3983	codeforces#P1152E Neko and Flashback constructive algorithms dfs and similar graphs *2400	0 / 0	9
	3982	codeforces#P1152F1 Neko Rules the Catniverse (Small Version) bitmasks dp matrices *2800	0 / 0	10
	3981	codeforces#P1152F2 Neko Rules the Catniverse (Large Version) bitmasks dp matrices *3000	0 / 0	10
	3980	codeforces#P1153A Serval and Bus brute force math *1000	0 / 0	3
	3979	codeforces#P1153B Serval and Toy Bricks constructive algorithms greedy *1200	0 / 0	4
	3978	codeforces#P1153C Serval and Parenthesis Sequence greedy strings *1700	0 / 0	5
	3977	codeforces#P1153D Serval and Rooted Tree binary search dfs and similar dp greedy trees *1900	0 / 0	6
	3976	codeforces#P1153E Serval and Snake binary search brute force interactive *2200	0 / 0	8
	3975	codeforces#P1153F Serval and Bonus Problem combinatorics dp math probabilities *2600	0 / 0	10
	3974	codeforces#P1154A Restoring Three Numbers math *800	0 / 0	3
	3973	codeforces#P1154B Make Them Equal math *1200	0 / 0	4
	3972	codeforces#P1154C Gourmet Cat implementation math *1400	0 / 0	4
	3971	codeforces#P1154D Walking Robot greedy *1500	0 / 0	5
	3970	codeforces#P1154E Two Teams data structures implementation sortings *1800	0 / 0	6
	3969	codeforces#P1154F Shovels Shop dp greedy sortings *2100	0 / 0	7
	3968	codeforces#P1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	8
	3967	codeforces#P1155A Reverse a Substring implementation sortings strings *1000	0 / 0	3
	3966	codeforces#P1155B Game with Telephone Numbers games greedy implementation *1200	0 / 0	4
	3965	codeforces#P1155C Alarm Clocks Everywhere math number theory *1300	0 / 0	4
	3964	codeforces#P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	6
	3963	codeforces#P1155E Guess the Root brute force interactive math *2200	0 / 0	8
	3962	codeforces#P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	10
	3961	codeforces#P1156A Inscribed Figures geometry *1400	0 / 0	4
	3960	codeforces#P1156B Ugly Pairs dfs and similar greedy implementation sortings strings *1800	0 / 0	6
	3959	codeforces#P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	7
	3958	codeforces#P1156D 0-1-Tree dfs and similar divide and conquer dp dsu trees *2200	0 / 0	8
	3957	codeforces#P1156E Special Segments of Permutation data structures divide and conquer dsu two pointers *2200	0 / 0	8

Pick a problem randomly based on the current filter.