Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6273	P1631A Min Max Swap greedy *800	0 / 0	(None)
	6274	P1632A ABC implementation *800	0 / 0	(None)
	6275	P1632B Roof Construction bitmasks constructive algorithms *1000	5 / 9	9
	6276	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	(None)
	6277	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	(None)
	6278	P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	(None)
	6279	P1633B Minority greedy *800	0 / 0	(None)
	6280	P1633C Kill the Monster brute force math *1100	0 / 0	(None)
	6281	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	(None)
	6282	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
	6283	P1634B Fortune Telling bitmasks math *1400	0 / 0	(None)
	6284	P1634D Finding Zero constructive algorithms interactive math *2000	0 / 0	(None)
	6285	P1634F Fibonacci Additions brute force data structures hashing implementation math *2700	0 / 0	(None)
	6286	P1635B Avoid Local Maximums greedy *800	0 / 0	(None)
	6287	P1635C Differential Sorting constructive algorithms greedy *1200	0 / 0	(None)
	6288	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	(None)
	6289	P1635F Closest Pair data structures greedy *2800	0 / 0	(None)
	6290	P1637B MEX and Array brute force dp greedy math *1100	0 / 0	(None)
	6291	P1637D Yet Another Minimization Problem dp greedy math *1800	0 / 0	(None)
	6292	P1637E Best Pair binary search brute force implementation *2100	0 / 0	(None)

Pick a problem randomly based on the current filter.