Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	78	P1631B Fun with Even Subarrays dp greedy *1100	0 / 0	(None)
	77	P1632A ABC implementation *800	0 / 0	(None)
	76	P1632B Roof Construction bitmasks constructive algorithms *1000	0 / 0	(None)
	75	P1632C Strange Test binary search bitmasks brute force dp math *1600	0 / 0	(None)
	74	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	(None)
	73	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	(None)
	72	P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	(None)
	71	P1633A Div brute force *800	0 / 0	(None)
	70	P1633B Minority greedy *800	0 / 0	(None)
	69	P1633C Kill the Monster brute force math *1100	0 / 0	(None)
	68	P1633D Make Them Equal dp greedy *1600	0 / 0	(None)
	67	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	(None)
	66	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
	65	P1634A Reverse and Concatenate greedy strings *800	0 / 0	(None)
	64	P1634B Fortune Telling bitmasks math *1400	0 / 0	(None)
	63	P1634C OKEA constructive algorithms *1000	0 / 0	(None)
	62	P1634D Finding Zero constructive algorithms interactive math *2000	0 / 0	(None)
	61	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	(None)
	60	P1634F Fibonacci Additions brute force data structures hashing implementation math *2700	0 / 0	(None)
	59	P1635A Min Or Sum bitmasks greedy *800	0 / 0	(None)

Pick a problem randomly based on the current filter.