*2200 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	96	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	(None)
	83	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	(None)
	55	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	(None)
	26	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	(None)
	10	P1646E Power Board brute force dp math number theory *2200	0 / 0	(None)
	7742	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	(None)
	7843	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	(None)
	7891	P1717E Madoka and The Best University math number theory *2200	0 / 0	(None)
	7945	P1730D Prefixes and Suffixes constructive algorithms strings *2200	0 / 0	8
	8163	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	8161	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	8121	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	8246	P1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	8
	8282	P1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation *2200	0 / 0	8
	8234	P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	8351	P1808E1 Minibuses on Venus (easy version) combinatorics dp *2200	0 / 0	8
	8369	P1811G2 Vlad and the Nice Paths (hard version) binary search combinatorics data structures dp math two pointers *2200	0 / 0	8
	8396	P1815C Between constructive algorithms dfs and similar graphs greedy *2200	0 / 0	8
	8419	P1822G2 Magic Triples (Hard Version) brute force data structures math number theory *2200	0 / 0	8
	8436	P1832E Combinatorics Problem brute force combinatorics dp *2200	0 / 0	8

Pick a problem randomly based on the current filter.