Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1338	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(None)
	1337	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(None)
	1336	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	(None)
	1335	P1392A Omkar and Password greedy math *800	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)
	1332	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	(None)
	1331	P1392E Omkar and Duck bitmasks constructive algorithms interactive math *2100	0 / 0	(None)
	1330	P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	(None)
	1329	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	(None)
	1328	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	(None)
	1327	P1392I Kevin and Grid fft graphs math *3300	0 / 0	(None)
	1326	P1393A Rainbow Dash, Fluttershy and Chess Coloring greedy math *800	0 / 0	(None)
	1325	P1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	0 / 0	(None)
	1324	P1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	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)
	1321	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(None)
	1320	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(None)
	1319	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(None)

Pick a problem randomly based on the current filter.