Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5455	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	(None)
	5456	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
	5457	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(None)
	5458	P1379A Acacius and String brute force implementation strings *1500	0 / 0	(None)
	5459	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	(None)
	5460	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	5461	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
	5462	P1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	(None)
	5463	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(None)
	1380	1380 【入门】城市之间的最短路图论	0 / 0	(None)
	5464	P1380B Universal Solution greedy *1400	0 / 0	(None)
	5465	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(None)
	5466	P1380F Strange Addition data structures dp matrices *2600	0 / 0	(None)
	5467	P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	(None)
	5468	P1381B Unmerge dp *1800	0 / 0	(None)
	5469	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
	5470	P1382A Common Subsequence brute force *800	0 / 0	(None)
	5471	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
	5472	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
	5473	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.