trees - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4355	P763A Timofey and a tree dfs and similar dp dsu graphs implementation trees *1600	0 / 0	(None)
	4352	P763D Timofey and a flat tree data structures graphs hashing shortest paths trees *2900	0 / 0	(None)
	4344	P765E Tree Folding dfs and similar dp greedy implementation trees *2200	0 / 0	(None)
	4337	P766E Mahmoud and a xor trip bitmasks constructive algorithms data structures dfs and similar dp math trees *2100	0 / 0	(None)
	4334	P767C Garland dfs and similar graphs greedy trees *2000	0 / 0	(None)
	4314	P771C Bear and Tree Jumps dfs and similar dp trees *2100	0 / 0	(None)
	4306	P772E Verifying Kingdom binary search divide and conquer interactive trees *3200	0 / 0	(None)
	4281	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	(None)
	4272	P778C Peterson Polyglot brute force dfs and similar dsu hashing strings trees *2500	0 / 0	(None)
	4264	P780C Andryusha and Colored Balloons dfs and similar graphs greedy trees *1600	0 / 0	(None)
	4243	P786D Rap God data structures dfs and similar hashing strings trees *3400	0 / 0	(None)
	4242	P786E ALT data structures flows graphs trees *3200	0 / 0	(None)
	4228	P792D Paths in a Complete Binary Tree bitmasks trees *1900	0 / 0	(None)
	4221	P793E Problem of offices constructive algorithms dfs and similar dp trees *2900	0 / 0	(None)
	4209	P796C Bank Hacking constructive algorithms data structures dp trees *1900	0 / 0	(None)
	4208	P796D Police Stations constructive algorithms dfs and similar dp graphs shortest paths trees *2100	0 / 0	(None)
	4176	P802J Send the Fool Further! (easy) dfs and similar graphs trees *1400	0 / 0	(None)
	4175	P802K Send the Fool Further! (medium) dp trees *2100	0 / 0	(None)
	4174	P802L Send the Fool Further! (hard) dfs and similar dp math trees *2400	0 / 0	(None)
	4160	P804D Expected diameter of a tree binary search brute force dfs and similar dp sortings trees *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.