graphs - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3470	P962F Simple Cycles Edges dfs and similar graphs trees *2400	0 / 0	(None)
	3446	P976D Degree Set constructive algorithms graphs implementation *2500	0 / 0	(None)
	3444	P976F Minimal k-covering flows graphs *2500	0 / 0	(None)
	3439	P977E Cyclic Components dfs and similar dsu graphs *1500	0 / 0	(None)
	3420	P980F Cactus to Tree dp graphs trees *2900	0 / 0	(None)
	3409	P982C Cut 'em all! dfs and similar dp graphs greedy trees *1500	0 / 0	(None)
	3406	P982F The Meeting Place Cannot Be Changed dfs and similar graphs *2700	0 / 0	(None)
	3403	P983C Elevator dp graphs shortest paths *2400	0 / 0	(None)
	3391	P986A Fair graphs greedy number theory shortest paths *1600	0 / 0	(None)
	3389	P986C AND Graph bitmasks dfs and similar dsu graphs *2500	0 / 0	(None)
	3386	P986F Oppa Funcan Style Remastered graphs math number theory shortest paths *3300	0 / 0	(None)
	3374	P989C A Mist of Florescence constructive algorithms graphs *1800	0 / 0	(None)
	3368	P990D Graph And Its Complement constructive algorithms graphs implementation *1700	0 / 0	(None)
	3341	P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	(None)
	3326	P999E Reachability from the Capital dfs and similar graphs greedy *2000	0 / 0	(None)
	3320	P1000E We Need More Bosses dfs and similar graphs trees *2100	0 / 0	(None)
	3289	P1003E Tree Constructing constructive algorithms graphs *2100	0 / 0	(None)
	3275	P1005F Berland and the Shortest Paths brute force dfs and similar graphs shortest paths *2100	0 / 0	(None)
	3270	P1006E Military Problem dfs and similar graphs trees *1600	0 / 0	(None)
	3258	P1009D Relatively Prime Graph brute force constructive algorithms graphs greedy math *1700	0 / 0	(None)

Pick a problem randomly based on the current filter.