Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7636	P1692D The Clock brute force implementation	0 / 0	(None)
	7635	P1692E Binary Deque binary search implementation two pointers	0 / 0	(None)
	7634	P1692F 3SUM brute force math	0 / 0	(None)
	7633	P1692G 2^Sort data structures dp sortings two pointers	0 / 0	(None)
	7632	P1692H Gambling data structures dp greedy math	0 / 0	(None)
	7753	P1693A Directional Increase greedy *1300	0 / 0	(None)
	7752	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	(None)
	7751	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	(None)
	7750	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(None)
	7749	P1693E Outermost Maximums data structures greedy *3400	0 / 0	(None)
	7748	P1693F I Might Be Wrong binary search greedy two pointers *3400	0 / 0	(None)
	7747	P1694A Creep greedy implementation *800	0 / 0	(None)
	7746	P1694B Paranoid String constructive algorithms greedy *1200	0 / 0	(None)
	7745	P1695A Subrectangle Guess games *800	0 / 0	(None)
	7744	P1695B Circle Game games greedy *1000	0 / 0	(None)
	7743	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	(None)
	7742	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	(None)
	7741	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	(None)
	7740	P1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs *2700	0 / 0	(None)
	7739	P1696A NIT orz! bitmasks greedy	0 / 0	(None)

Pick a problem randomly based on the current filter.