dfs and similar - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5899	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	(None)
	5907	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(None)
	5949	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
	5950	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	5954	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(None)
	5955	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	(None)
	5959	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	(None)
	5969	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(None)
	5987	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	(None)
	5997	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
	6002	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	6013	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
	6023	P1554E You dfs and similar dp math number theory *2600	0 / 0	(None)
	6037	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
	6045	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
	6054	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
	6059	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
	6077	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
	6079	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(None)
	6114	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.