constructive algorithms - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	262	P1603A Di-visible Confusion constructive algorithms math number theory *1300	0 / 0	(None)
	261	P1603B Moderate Modular Mode constructive algorithms math number theory *1600	0 / 0	(None)
	251	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	(None)
	245	P1606D Red-Blue Matrix brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
	234	P1608A Find Array constructive algorithms math *800	0 / 0	(None)
	233	P1608B Build the Permutation constructive algorithms greedy *1200	0 / 0	(None)
	214	P1610F Mashtali: a Space Oddysey constructive algorithms dfs and similar graphs *3000	0 / 0	(None)
	210	P1611A Make Even constructive algorithms math *800	0 / 0	(None)
	209	P1611B Team Composition: Programmers and Mathematicians binary search constructive algorithms math *800	0 / 0	(None)
	208	P1611C Polycarp Recovers the Permutation constructive algorithms *1000	0 / 0	(None)
	207	P1611D Weights Assignment For Tree Edges constructive algorithms trees *1500	0 / 0	(None)
	202	P1612A Distance brute force constructive algorithms *800	0 / 0	(None)
	201	P1612B Special Permutation constructive algorithms greedy *900	0 / 0	(None)
	196	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	(None)
	189	P1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	(None)
	188	P1614B Divan and a New Project constructive algorithms sortings *1000	0 / 0	(None)
	187	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	(None)
	177	P1615G Maximum Adjacent Pairs constructive algorithms graph matchings *3300	0 / 0	(None)
	176	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(None)
	167	P1617A Forbidden Subsequence constructive algorithms greedy sortings strings *800	0 / 0	(None)

Pick a problem randomly based on the current filter.