implementation - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1407	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
	1397	P1379A Acacius and String brute force implementation strings *1500	0 / 0	(None)
	1388	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(None)
	1387	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(None)
	1386	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	(None)
	1382	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	(None)
	1380	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	(None)
	1367	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(None)
	1363	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
	1361	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	(None)
	1360	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(None)
	1349	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
	1344	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	(None)
	1339	P1391B Fix You brute force greedy implementation *800	0 / 0	(None)
	1337	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(None)
	1334	P1392B Omkar and Infinity Clock implementation math *800	0 / 0	(None)
	1333	P1392C Omkar and Waterslide greedy implementation *1200	0 / 0	(None)
	1325	P1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	0 / 0	(None)
	1323	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	(None)
	1322	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.