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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	526	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
	518	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	504	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
	500	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
	497	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	(None)
	495	P1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	(None)
	490	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	(None)
	481	P1554E You dfs and similar dp math number theory *2600	0 / 0	(None)
	457	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
	451	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
	444	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(None)
	443	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
	427	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
	418	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(None)
	412	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(None)
	390	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(None)
	388	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
	384	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(None)
	364	P1578J Just Kingdom brute force data structures dfs and similar *3100	0 / 0	(None)
	332	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.