Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1378	P1381E Origami geometry math sortings *3300	0 / 0	(None)
	1377	P1382A Common Subsequence brute force *800	0 / 0	(None)
	1376	P1382B Sequential Nim dp games *1100	0 / 0	(None)
	1375	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
	1374	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(None)
	1373	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
	1372	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
	1371	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(None)
	1370	P1383F Special Edges flows graphs *3200	0 / 0	(None)
	1369	P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	(None)
	1368	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(None)
	1367	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(None)
	1366	P1385A Three Pairwise Maximums math *800	0 / 0	(None)
	1365	P1385B Restore the Permutation by Merger greedy *800	0 / 0	(None)
	1364	P1385C Make It Good greedy *1200	0 / 0	(None)
	1363	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
	1362	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	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)
	1359	P1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	(None)

Pick a problem randomly based on the current filter.