constructive algorithms - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8210	P1787A Exponential Equation constructive algorithms math *800	0 / 0	3
	8206	P1787E The Harmonization of XOR bitmasks constructive algorithms greedy math *2100	0 / 0	7
	8205	P1787F Inverse Transformation constructive algorithms implementation math *2500	0 / 0	9
	8249	P1788B Sum of Two Numbers constructive algorithms greedy implementation math probabilities *1100	0 / 0	3
	8248	P1788C Matching Numbers constructive algorithms greedy math *1300	0 / 0	4
	8245	P1788F XOR, Tree, and Queries bitmasks constructive algorithms dfs and similar dsu graphs greedy implementation trees *2500	0 / 0	9
	8282	P1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation *2200	0 / 0	8
	8197	P1790E Vlad and a Pair of Numbers bitmasks constructive algorithms *1400	0 / 0	4
	8195	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	8243	P1793B Fedya and Array constructive algorithms math *1100	0 / 0	3
	8242	P1793C Dora and Search constructive algorithms data structures two pointers *1200	0 / 0	4
	8279	P1794A Prefix and Suffix Array constructive algorithms strings	0 / 0	(None)
	8278	P1794B Not Dividing constructive algorithms greedy math	0 / 0	(None)
	8233	P1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	9
	8327	P1798D Shocking Arrangement constructive algorithms dp greedy math	0 / 0	(None)
	8267	P1799B Equalize by Divide brute force constructive algorithms greedy math	0 / 0	(None)
	8263	P1799E City Union constructive algorithms dfs and similar dsu geometry greedy implementation math	0 / 0	(None)
	8254	P1800E1 Unforgivable Curse (easy version) brute force constructive algorithms dsu graphs greedy	0 / 0	(None)
	8253	P1800E2 Unforgivable Curse (hard version) brute force constructive algorithms dsu graphs greedy	0 / 0	(None)
	8294	P1801A The Very Beautiful Blanket bitmasks constructive algorithms	0 / 0	(None)

Pick a problem randomly based on the current filter.