Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4380	P1037C Equalize dp greedy strings *1300	0 / 0	(None)
	4381	P1037D Valid BFS? dfs and similar graphs shortest paths trees *1700	0 / 0	(None)
	4382	P1037F Maximum Reduction combinatorics data structures math *2500	0 / 0	(None)
	4383	P1037G A Game on Strings games *3200	0 / 0	(None)
	4384	P1037H Security data structures string suffix structures *3200	0 / 0	(None)
	42	P1038 水仙花数蓝桥杯入门训练其他语法	310 / 886	5
	4385	P1038B Non-Coprime Partition constructive algorithms math *1100	0 / 0	(None)
	4386	P1038D Slime dp greedy implementation *1800	0 / 0	(None)
	4387	P1038E Maximum Matching bitmasks brute force dfs and similar dp graphs *2400	0 / 0	(None)
	43	P1039 判断质数蓝桥杯入门训练其他语法	247 / 1242	7
	4388	P1039A Timetable constructive algorithms data structures greedy math *2300	0 / 0	(None)
	4389	P1039B Subway Pursuit binary search interactive probabilities *2100	0 / 0	(None)
	4390	P1039D You Are Given a Tree data structures dp trees *2800	0 / 0	(None)
	44	P1040 分解质因数其他语法蓝桥杯入门训练	234 / 968	7
	4391	P1040A Palindrome Dance greedy *1000	0 / 0	(None)
	45	P1041 全排列蓝桥杯入门训练其他语法	119 / 324	5
	4392	P1041A Heist greedy implementation sortings *800	0 / 0	(None)
	4393	P1041B Buying a TV Set math *1000	0 / 0	(None)
	4394	P1041C Coffee Break binary search data structures greedy two pointers *1600	0 / 0	(None)
	4395	P1041E Tree Reconstruction constructive algorithms data structures graphs greedy *1900	0 / 0	(None)

Pick a problem randomly based on the current filter.